<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<title>Data Structures for Sets and Graphs: graphs/ColoringHeuristic.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">Data Structures for Sets and Graphs
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.1.1 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark">&#160;</span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark">&#160;</span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(9)"><span class="SelectionMark">&#160;</span>Friends</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(10)"><span class="SelectionMark">&#160;</span>Macros</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="dir_014563f092b9a36e69e485d819dd177d.html">graphs</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="headertitle">
<div class="title">ColoringHeuristic.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="ColoringHeuristic_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/*</span></div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment"> * GraphAlgorithm.h</span></div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment"> *  Created on: 02/09/2012</span></div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment"> *      Author: marcio</span></div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;</div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="preprocessor">#ifndef GRAPHALGORITHM_H_</span></div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define GRAPHALGORITHM_H_</span></div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="DirectlyAddressedSet_8h.html">DirectlyAddressedSet.h</a>&quot;</span></div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="BitMapDirectlyAddressedSet_8h.html">BitMapDirectlyAddressedSet.h</a>&quot;</span></div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="Graph_8h.html" title="A data structure representing a Simple Graph.">Graph.h</a>&quot;</span></div>
<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="heap_8h.html">heap.h</a>&quot;</span></div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="preprocessor">#include &lt;cstring&gt;</span></div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;</div>
<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>D&gt;</div>
<div class="line"><a name="l00040"></a><span class="lineno"><a class="code" href="classColoringHeuristic.html">   40</a></span>&#160;<span class="keyword">class </span><a class="code" href="classColoringHeuristic.html" title="This class encapsulates a set of algorithms to color a graph.">ColoringHeuristic</a> {</div>
<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;<span class="keyword">protected</span>:</div>
<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;</div>
<div class="line"><a name="l00043"></a><span class="lineno"><a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273">   43</a></span>&#160;        <span class="keyword">const</span> <span class="keywordtype">long</span>                      <a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a>;                      </div>
<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;</div>
<div class="line"><a name="l00045"></a><span class="lineno"><a class="code" href="classColoringHeuristic.html#a40cd35433cef882c6d01ba41ba8bb324">   45</a></span>&#160;        <a class="code" href="classFactory.html">Factory&lt;D&lt;T&gt;</a> &gt; *        <a class="code" href="classColoringHeuristic.html#a40cd35433cef882c6d01ba41ba8bb324">factory</a>;</div>
<div class="line"><a name="l00046"></a><span class="lineno"><a class="code" href="classColoringHeuristic.html#ae4cf7db5667d8d65aa6b7c41ee27ef60">   46</a></span>&#160;        D&lt;T&gt; * <span class="keyword">const</span>            <a class="code" href="classColoringHeuristic.html#ae4cf7db5667d8d65aa6b7c41ee27ef60">bitR</a>;</div>
<div class="line"><a name="l00047"></a><span class="lineno"><a class="code" href="classColoringHeuristic.html#a99bba05a6a6c8df2bc7ffb4f1f5aea9b">   47</a></span>&#160;        D&lt;T&gt; ** <span class="keyword">const</span>           <a class="code" href="classColoringHeuristic.html#a99bba05a6a6c8df2bc7ffb4f1f5aea9b">colors</a>;</div>
<div class="line"><a name="l00048"></a><span class="lineno"><a class="code" href="classColoringHeuristic.html#ad51d1ebb6f77365b5737001d39b62324">   48</a></span>&#160;        <a class="code" href="classAndFilter.html" title="Filter for thelogic operation and.">AndFilter&lt;T&gt;</a> *          <a class="code" href="classColoringHeuristic.html#ad51d1ebb6f77365b5737001d39b62324">andFilter</a>;</div>
<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;</div>
<div class="line"><a name="l00050"></a><span class="lineno"><a class="code" href="classColoringHeuristic.html#a2dce80a62997557dc676eb05565c5379">   50</a></span>&#160;        <span class="keywordtype">long</span> *                          <a class="code" href="classColoringHeuristic.html#a2dce80a62997557dc676eb05565c5379" title="inverse of input mappings">invR</a>;           </div>
<div class="line"><a name="l00051"></a><span class="lineno"><a class="code" href="classColoringHeuristic.html#a3af684edbb71a7a430e05e3e79ec938c">   51</a></span>&#160;        D&lt;T&gt; * <span class="keyword">const</span>            <a class="code" href="classColoringHeuristic.html#a3af684edbb71a7a430e05e3e79ec938c">degR</a>;</div>
<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;</div>
<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;        <a class="code" href="classColoringHeuristic.html#aab770ebba9e775828c6d837b05c47852" title="Creates a covering algorithm object.">ColoringHeuristic</a>(<span class="keywordtype">long</span> <a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a>, <a class="code" href="classFactory.html">Factory</a>&lt;D&lt;T&gt; &gt; * f);</div>
<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;</div>
<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;        <span class="keyword">virtual</span> <a class="code" href="classColoringHeuristic.html#a7e73234d994a1af4002a87354fb68b1f">~ColoringHeuristic</a>();</div>
<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;</div>
<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;        <span class="keywordtype">long</span> <a class="code" href="classColoringHeuristic.html#a043dfbbdcaf49f350254e1738de34f82">run</a>(<a class="code" href="classGraph.html">Graph</a>&lt;D&lt;T&gt; &gt; * g, <span class="keywordtype">long</span> * res, <span class="keywordtype">long</span> * R, <span class="keywordtype">long</span> r) = 0;</div>
<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;        <span class="keyword">static</span> <span class="keywordtype">long</span> <a class="code" href="classColoringHeuristic.html#aa54345bb1fc4a68dd9b135bdb2ecb098">bucketSort</a>(<span class="keywordtype">long</span> * color, <span class="keywordtype">long</span> cmin, <span class="keywordtype">long</span> cmax, <span class="keywordtype">long</span> * R, <span class="keywordtype">long</span> r);</div>
<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;</div>
<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;        <span class="keyword">static</span> <a class="code" href="classColoringHeuristic.html" title="This class encapsulates a set of algorithms to color a graph.">ColoringHeuristic&lt;T, D&gt;</a> * <a class="code" href="classColoringHeuristic.html#a7bfb89fa3681e587f3b3f52e5c8183b1" title="Made a greedy coloring of the subgraph induced by the vertexes in R, with the order that they appear ...">greedy</a>(<span class="keywordtype">long</span> <a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a>, <a class="code" href="classFactory.html">Factory&lt;D&gt;</a> * <a class="code" href="classColoringHeuristic.html#a40cd35433cef882c6d01ba41ba8bb324">factory</a>);</div>
<div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;</div>
<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;        <span class="keyword">static</span> <a class="code" href="classColoringHeuristic.html" title="This class encapsulates a set of algorithms to color a graph.">ColoringHeuristic&lt;T, D&gt;</a> * <a class="code" href="classColoringHeuristic.html#a449990b4b90c04a0ba4d0cf55f7f9280" title="Determines a greedy coloring of the subgraph induced by the specified vertices using the Dsatur algor...">dsatur</a>(<span class="keywordtype">long</span> <a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a>, <a class="code" href="classFactory.html">Factory&lt;D&gt;</a> * <a class="code" href="classColoringHeuristic.html#a40cd35433cef882c6d01ba41ba8bb324">factory</a>);</div>
<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;</div>
<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;        <span class="keyword">static</span> <a class="code" href="classColoringHeuristic.html" title="This class encapsulates a set of algorithms to color a graph.">ColoringHeuristic&lt;T, D&gt;</a> * <a class="code" href="classColoringHeuristic.html#a3daa607fd5e566bb6f9b7317aec0120c" title="Cover the vertexes of the graph according its degree and the degree of its neighbours.">mcr</a>(<span class="keywordtype">long</span> <a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a>, <a class="code" href="classFactory.html">Factory&lt;D&gt;</a> * <a class="code" href="classColoringHeuristic.html#a40cd35433cef882c6d01ba41ba8bb324">factory</a>);</div>
<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;</div>
<div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;        <span class="keyword">static</span> <span class="keywordtype">double</span> <a class="code" href="classColoringHeuristic.html#a81c3d4609d908cc8a16d1d4cd311b47e">FCP2</a>(<a class="code" href="classGraph.html">Graph</a> * g, <span class="keywordtype">long</span> k, <span class="keywordtype">long</span>** rank);</div>
<div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;};</div>
<div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;</div>
<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>D&gt;</div>
<div class="line"><a name="l00158"></a><span class="lineno"><a class="code" href="classColoringHeuristic.html#aab770ebba9e775828c6d837b05c47852">  158</a></span>&#160;<a class="code" href="classColoringHeuristic.html#aab770ebba9e775828c6d837b05c47852" title="Creates a covering algorithm object.">ColoringHeuristic&lt;T, D&gt;::ColoringHeuristic</a>(<span class="keywordtype">long</span> n, <a class="code" href="classFactory.html">Factory</a>&lt;D&lt;T&gt; &gt; * f) : n(n), factory(f) {</div>
<div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;        <a class="code" href="classColoringHeuristic.html#ae4cf7db5667d8d65aa6b7c41ee27ef60">bitR</a> = <a class="code" href="classColoringHeuristic.html#a40cd35433cef882c6d01ba41ba8bb324">factory</a>-&gt;<a class="code" href="classFactory.html#a0ed0b3527539a0631d8147d8aa94b75a">newInstance</a>(n);</div>
<div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;        <a class="code" href="classColoringHeuristic.html#a99bba05a6a6c8df2bc7ffb4f1f5aea9b">colors</a> = <span class="keyword">new</span> T[<a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a>];</div>
<div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;        <span class="keywordtype">long</span> j;</div>
<div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;        <span class="keywordflow">for</span> (j = 0 ; j &lt; <a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a>; j++)</div>
<div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;                <a class="code" href="classColoringHeuristic.html#a99bba05a6a6c8df2bc7ffb4f1f5aea9b">colors</a>[j] = <a class="code" href="classColoringHeuristic.html#a40cd35433cef882c6d01ba41ba8bb324">factory</a>-&gt;<a class="code" href="classFactory.html#a0ed0b3527539a0631d8147d8aa94b75a">newInstance</a>(n);</div>
<div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;        <a class="code" href="classColoringHeuristic.html#ad51d1ebb6f77365b5737001d39b62324">andFilter</a> = <span class="keyword">new</span> <a class="code" href="classAndFilter.html" title="Filter for thelogic operation and.">AndFilter&lt;T&gt;</a>();</div>
<div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;        <a class="code" href="classColoringHeuristic.html#a3af684edbb71a7a430e05e3e79ec938c">degR</a> = f-&gt;newInstance(n);</div>
<div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;        <a class="code" href="classColoringHeuristic.html#a2dce80a62997557dc676eb05565c5379" title="inverse of input mappings">invR</a> = <span class="keyword">new</span> <span class="keywordtype">long</span>[<a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a>];</div>
<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;}</div>
<div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;</div>
<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>D&gt;</div>
<div class="line"><a name="l00170"></a><span class="lineno"><a class="code" href="classColoringHeuristic.html#a7e73234d994a1af4002a87354fb68b1f">  170</a></span>&#160;<a class="code" href="classColoringHeuristic.html#a7e73234d994a1af4002a87354fb68b1f">ColoringHeuristic&lt;T, D&gt;::~ColoringHeuristic</a>() {</div>
<div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;        <span class="keyword">delete</span> andFilter;</div>
<div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;</div>
<div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">long</span> j = 0 ; j &lt; n; j++)</div>
<div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;                <span class="keyword">delete</span> colors[j];</div>
<div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;        <span class="keyword">delete</span>[] colors;</div>
<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;        <span class="keyword">delete</span> bitR;</div>
<div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;        <span class="keyword">delete</span> degR;</div>
<div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;        <span class="keyword">delete</span>[] invR;</div>
<div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;}</div>
<div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;</div>
<div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>D&gt;</div>
<div class="line"><a name="l00182"></a><span class="lineno"><a class="code" href="classTripleList.html">  182</a></span>&#160;<span class="keyword">class </span><a class="code" href="classTripleList.html">TripleList</a> {</div>
<div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;<span class="keyword">protected</span>:</div>
<div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;</div>
<div class="line"><a name="l00185"></a><span class="lineno"><a class="code" href="classTripleList.html#af71547cc63e3a54c29197e44722e1ec2">  185</a></span>&#160;        <span class="keywordtype">long</span> *                          <a class="code" href="classTripleList.html#af71547cc63e3a54c29197e44722e1ec2" title="list of keys, level 1">next1</a>;          </div>
<div class="line"><a name="l00186"></a><span class="lineno"><a class="code" href="classTripleList.html#aab3817a2764e1336fa5b7ed999d7ec58">  186</a></span>&#160;        <span class="keywordtype">long</span> *                          <a class="code" href="classTripleList.html#aab3817a2764e1336fa5b7ed999d7ec58" title="list of keys, level 2">next2</a>;          </div>
<div class="line"><a name="l00187"></a><span class="lineno"><a class="code" href="classTripleList.html#abf9d51d938d247995085af7ba7155639">  187</a></span>&#160;        <span class="keywordtype">long</span> *                          <a class="code" href="classTripleList.html#abf9d51d938d247995085af7ba7155639" title="list of keys, level 1">prev1</a>;          </div>
<div class="line"><a name="l00188"></a><span class="lineno"><a class="code" href="classTripleList.html#a331bd0e889dbcbe4bc648033d1ff6b5a">  188</a></span>&#160;        <span class="keywordtype">long</span> *                          <a class="code" href="classTripleList.html#a331bd0e889dbcbe4bc648033d1ff6b5a" title="list of keys, level 2">prev2</a>;          </div>
<div class="line"><a name="l00189"></a><span class="lineno"><a class="code" href="classTripleList.html#abd3d51ee488b629241118f3e75181656">  189</a></span>&#160;        <span class="keywordtype">long</span> *                          <a class="code" href="classTripleList.html#abd3d51ee488b629241118f3e75181656" title="key, level 1">key1</a>;           </div>
<div class="line"><a name="l00190"></a><span class="lineno"><a class="code" href="classTripleList.html#a2ebc729a9e5d875396fe0cb960abe18a">  190</a></span>&#160;        <span class="keywordtype">long</span> *                          <a class="code" href="classTripleList.html#a2ebc729a9e5d875396fe0cb960abe18a" title="first element of the associated list of level 3">vert</a>;           </div>
<div class="line"><a name="l00191"></a><span class="lineno"><a class="code" href="classTripleList.html#a9181d98f96c0b511765aaa0d2e20b48c">  191</a></span>&#160;        <span class="keywordtype">long</span> *                          <a class="code" href="classTripleList.html#a9181d98f96c0b511765aaa0d2e20b48c" title="node in the list of level 1">node1</a>;          </div>
<div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;</div>
<div class="line"><a name="l00193"></a><span class="lineno"><a class="code" href="classTripleList.html#adfe99d3815e45e63f74ab47f8683057b">  193</a></span>&#160;        <span class="keywordtype">long</span>                            <a class="code" href="classTripleList.html#adfe99d3815e45e63f74ab47f8683057b" title="free nodes of the lists of degrees">freehead</a>;       </div>
<div class="line"><a name="l00194"></a><span class="lineno"><a class="code" href="classTripleList.html#a469a1eb5ba9b3b3099194dfee529810b">  194</a></span>&#160;        <span class="keywordtype">long</span>                            <a class="code" href="classTripleList.html#a469a1eb5ba9b3b3099194dfee529810b" title="lists of levels 1 and 2">tail12</a>;         </div>
<div class="line"><a name="l00195"></a><span class="lineno"><a class="code" href="classTripleList.html#af0864a18d60cd5892fde30da01731914">  195</a></span>&#160;        <span class="keywordtype">long</span>                            <a class="code" href="classTripleList.html#af0864a18d60cd5892fde30da01731914" title="head of the list of level 1">head1</a>;          </div>
<div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;</div>
<div class="line"><a name="l00197"></a><span class="lineno"><a class="code" href="classTripleList.html#a7c80b10cbb606747983e400388c4d56b">  197</a></span>&#160;        <span class="keywordtype">long</span> *                          <a class="code" href="classTripleList.html#a7c80b10cbb606747983e400388c4d56b" title="list of keys, level 3">next3</a>;          </div>
<div class="line"><a name="l00198"></a><span class="lineno"><a class="code" href="classTripleList.html#a9ba96334e155b58a6a429ccd1ad2612a">  198</a></span>&#160;        <span class="keywordtype">long</span> *                          <a class="code" href="classTripleList.html#a9ba96334e155b58a6a429ccd1ad2612a" title="list of keys, level 3">prev3</a>;          </div>
<div class="line"><a name="l00199"></a><span class="lineno"><a class="code" href="classTripleList.html#aaab5d459d0e3178ce3166a63e5639f25">  199</a></span>&#160;        <span class="keywordtype">long</span> *                          <a class="code" href="classTripleList.html#aaab5d459d0e3178ce3166a63e5639f25" title="key, level 3">key3</a>;           </div>
<div class="line"><a name="l00200"></a><span class="lineno"><a class="code" href="classTripleList.html#a8cec91a932c7fe797962970c5419ccda">  200</a></span>&#160;        <span class="keywordtype">long</span> *                          <a class="code" href="classTripleList.html#a8cec91a932c7fe797962970c5419ccda" title="node in the list of level 2">node2</a>;          </div>
<div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;</div>
<div class="line"><a name="l00202"></a><span class="lineno"><a class="code" href="classTripleList.html#acf9a6b974a80adfc8f4300fd9879e16a">  202</a></span>&#160;        <span class="keywordtype">long</span>                            <a class="code" href="classTripleList.html#acf9a6b974a80adfc8f4300fd9879e16a" title="lists of level 3">tail3</a>;          </div>
<div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;</div>
<div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;        <a class="code" href="classTripleList.html#ad145efba59a99aee809cbe2e49615c93">TripleList</a>(<span class="keywordtype">long</span> n, <a class="code" href="classFactory.html">Factory</a>&lt;D&lt;T&gt; &gt; * f);</div>
<div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;        <a class="code" href="classTripleList.html#a887729161d83a7dd95fa85de2910885c">~TripleList</a>();</div>
<div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;</div>
<div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;        <span class="keywordtype">long</span> <a class="code" href="classTripleList.html#af753d4e5f22471841f20deaf090ca3f5">removeFreeHead</a>();</div>
<div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;        <span class="keywordtype">void</span> <a class="code" href="classTripleList.html#ae60e85aa29d55da18bc0e41e07fea11d">removeFree</a>(<span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;        <span class="keywordtype">void</span> <a class="code" href="classTripleList.html#a33c44dca473b0b1b7cf3fe4a6fcfb621">addFreeHead</a>(<span class="keywordtype">long</span> i);</div>
<div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;        <span class="keywordtype">long</span> <a class="code" href="classTripleList.html#a4f8efcf3956617bd7cfc8d920657c23a">insertLevel1Before</a>(<span class="keywordtype">long</span> k);</div>
<div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;        <span class="keywordtype">long</span> <a class="code" href="classTripleList.html#a4aa4d03626de0d2605366922b2bf06cc">removeLevel1</a>(<span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;        <span class="keywordtype">long</span> <a class="code" href="classTripleList.html#a6f079bc4efae3b65aa33e4714772c653">removeLevel2</a>(<span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;        <span class="keywordtype">long</span> <a class="code" href="classTripleList.html#a5124ffe4c905c3b50123985cff8c3dc5">removeLevel3</a>(<span class="keywordtype">long</span> i);</div>
<div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;</div>
<div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;        <span class="keywordtype">long</span> <a class="code" href="classTripleList.html#a0c90d2faa8f9316b0edc084121f6df8a" title="Inserts the specified vertex in the list of structural degrees.">insertLevel2</a>(<span class="keywordtype">long</span> j, <span class="keywordtype">long</span> i);</div>
<div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;};</div>
<div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;</div>
<div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>D&gt;</div>
<div class="line"><a name="l00231"></a><span class="lineno"><a class="code" href="classTripleList.html#ad145efba59a99aee809cbe2e49615c93">  231</a></span>&#160;<a class="code" href="classTripleList.html#ad145efba59a99aee809cbe2e49615c93">TripleList&lt;T, D&gt;::TripleList</a>(<span class="keywordtype">long</span> n, <a class="code" href="classFactory.html">Factory</a>&lt;D&lt;T&gt; &gt; * f) {</div>
<div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;        <span class="keywordtype">long</span> nn = 1 + (n &lt;&lt; 1);  <span class="comment">// an index is left as sentinel</span></div>
<div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;</div>
<div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;        next1 = <span class="keyword">new</span> <span class="keywordtype">long</span>[(nn &lt;&lt; 2) + (nn &lt;&lt; 1) + 1];</div>
<div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;        next2 = next1+nn;</div>
<div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;        prev1 = next2+nn;</div>
<div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;        key1 = prev1+nn;</div>
<div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;        next3 = key1+nn;</div>
<div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;        prev3 = next3+n+1;</div>
<div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;        key3 = prev3+n+1;</div>
<div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;        node2 = key3+n+1;</div>
<div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;</div>
<div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;        prev2 = prev1;</div>
<div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;        node1 = key1;</div>
<div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;        vert = next1;</div>
<div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;</div>
<div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;        freehead = 0;</div>
<div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;        <span class="keywordflow">for</span> (tail12 = 0; tail12 &lt; nn; tail12++) {</div>
<div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;                next1[tail12] = tail12+1;</div>
<div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;                prev1[tail12] = tail12-1;</div>
<div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;        }</div>
<div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;        head1 = tail12;</div>
<div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;</div>
<div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;        tail3 = tail12;</div>
<div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;}</div>
<div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;</div>
<div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>D&gt;</div>
<div class="line"><a name="l00258"></a><span class="lineno"><a class="code" href="classTripleList.html#a887729161d83a7dd95fa85de2910885c">  258</a></span>&#160;<a class="code" href="classTripleList.html#a887729161d83a7dd95fa85de2910885c">TripleList&lt;T, D&gt;::~TripleList</a>() {</div>
<div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;        <span class="keyword">delete</span>[] next1;</div>
<div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;}</div>
<div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;</div>
<div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>D&gt;</div>
<div class="line"><a name="l00263"></a><span class="lineno"><a class="code" href="classTripleList.html#ae60e85aa29d55da18bc0e41e07fea11d">  263</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classTripleList.html#ae60e85aa29d55da18bc0e41e07fea11d">TripleList&lt;T, D&gt;::removeFree</a>(<span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;        next1[prev1[j]] = next1[j];</div>
<div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;        prev1[next1[j]] = prev1[j];</div>
<div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;        <span class="keywordflow">if</span> (j == freehead)</div>
<div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;                freehead = next1[j];</div>
<div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;}</div>
<div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;</div>
<div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>D&gt;</div>
<div class="line"><a name="l00271"></a><span class="lineno"><a class="code" href="classTripleList.html#af753d4e5f22471841f20deaf090ca3f5">  271</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classTripleList.html#af753d4e5f22471841f20deaf090ca3f5">TripleList&lt;T, D&gt;::removeFreeHead</a>() {</div>
<div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;        <span class="keywordtype">long</span> ret = freehead;</div>
<div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;</div>
<div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;        next1[prev1[freehead]] = next1[freehead];</div>
<div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;        prev1[next1[freehead]] = prev1[freehead];</div>
<div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;        freehead = next1[freehead];</div>
<div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;</div>
<div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;        <span class="keywordflow">return</span> ret;</div>
<div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;}</div>
<div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;</div>
<div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>D&gt;</div>
<div class="line"><a name="l00282"></a><span class="lineno"><a class="code" href="classTripleList.html#a33c44dca473b0b1b7cf3fe4a6fcfb621">  282</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classTripleList.html#a33c44dca473b0b1b7cf3fe4a6fcfb621">TripleList&lt;T, D&gt;::addFreeHead</a>(<span class="keywordtype">long</span> i) {</div>
<div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160;        next1[i] = freehead;</div>
<div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;        prev1[freehead] = i;</div>
<div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;        prev1[i] = tail12;</div>
<div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;        freehead = i;</div>
<div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;}</div>
<div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;</div>
<div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>D&gt;</div>
<div class="line"><a name="l00290"></a><span class="lineno"><a class="code" href="classTripleList.html#a0c90d2faa8f9316b0edc084121f6df8a">  290</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classTripleList.html#a0c90d2faa8f9316b0edc084121f6df8a" title="Inserts the specified vertex in the list of structural degrees.">TripleList&lt;T, D&gt;::insertLevel2</a>(<span class="keywordtype">long</span> j, <span class="keywordtype">long</span> i) {</div>
<div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;        <span class="keywordtype">long</span> h;</div>
<div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;        <span class="keywordflow">if</span> (next2[j] &lt; tail12) {</div>
<div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;                j = next2[j];</div>
<div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;                <span class="keywordflow">while</span> (next2[j] &lt; tail12 &amp;&amp; key3[vert[j]] &lt; key3[vert[i]])</div>
<div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;                        j = next2[j];</div>
<div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160;                <span class="keywordflow">if</span> (next2[j] &lt; tail12 &amp;&amp; key3[vert[j]] == key3[vert[i]])</div>
<div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;                        h = j;</div>
<div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;                <span class="keywordflow">else</span> <span class="keywordflow">if</span> (next2[j] == tail12) {</div>
<div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;                        h = j;</div>
<div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;                        j = tail12;</div>
<div class="line"><a name="l00301"></a><span class="lineno">  301</span>&#160;                }</div>
<div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;                <span class="keywordflow">else</span></div>
<div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;                        h = prev2[j];</div>
<div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160;        }</div>
<div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;        <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160;                h = j;</div>
<div class="line"><a name="l00307"></a><span class="lineno">  307</span>&#160;                j = tail12;</div>
<div class="line"><a name="l00308"></a><span class="lineno">  308</span>&#160;        }</div>
<div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;</div>
<div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;        <span class="keywordflow">if</span> (h == j) {</div>
<div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160;                next3[i] = vert[j];</div>
<div class="line"><a name="l00312"></a><span class="lineno">  312</span>&#160;                prev3[j] = i;</div>
<div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;                node2[i] = j;</div>
<div class="line"><a name="l00314"></a><span class="lineno">  314</span>&#160;                prev3[i] = tail3;</div>
<div class="line"><a name="l00315"></a><span class="lineno">  315</span>&#160;                vert[j] = i;</div>
<div class="line"><a name="l00316"></a><span class="lineno">  316</span>&#160;        }</div>
<div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;        <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;                <span class="keywordtype">long</span> l = freehead;</div>
<div class="line"><a name="l00319"></a><span class="lineno">  319</span>&#160;                prev2[next2[freehead]] = prev2[freehead];</div>
<div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;                freehead = next2[freehead];</div>
<div class="line"><a name="l00321"></a><span class="lineno">  321</span>&#160;</div>
<div class="line"><a name="l00322"></a><span class="lineno">  322</span>&#160;                next2[h] = l;</div>
<div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160;                prev2[l] = h;</div>
<div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160;                next2[l] = j;</div>
<div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;                prev2[j] = l;</div>
<div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;</div>
<div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;                vert[l] = i;</div>
<div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;                next3[i] = tail3;</div>
<div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;                node2[i] = l;</div>
<div class="line"><a name="l00330"></a><span class="lineno">  330</span>&#160;                prev3[i] = tail3;</div>
<div class="line"><a name="l00331"></a><span class="lineno">  331</span>&#160;                j = l;</div>
<div class="line"><a name="l00332"></a><span class="lineno">  332</span>&#160;        }</div>
<div class="line"><a name="l00333"></a><span class="lineno">  333</span>&#160;</div>
<div class="line"><a name="l00334"></a><span class="lineno">  334</span>&#160;        <span class="keywordflow">return</span> j;</div>
<div class="line"><a name="l00335"></a><span class="lineno">  335</span>&#160;}</div>
<div class="line"><a name="l00336"></a><span class="lineno">  336</span>&#160;</div>
<div class="line"><a name="l00337"></a><span class="lineno">  337</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>D&gt;</div>
<div class="line"><a name="l00338"></a><span class="lineno"><a class="code" href="classTripleList.html#a4f8efcf3956617bd7cfc8d920657c23a">  338</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classTripleList.html#a4f8efcf3956617bd7cfc8d920657c23a">TripleList&lt;T, D&gt;::insertLevel1Before</a>(<span class="keywordtype">long</span> k) {</div>
<div class="line"><a name="l00339"></a><span class="lineno">  339</span>&#160;        <span class="keywordtype">long</span> j = removeFreeHead();</div>
<div class="line"><a name="l00340"></a><span class="lineno">  340</span>&#160;        next1[prev1[k]] = j;</div>
<div class="line"><a name="l00341"></a><span class="lineno">  341</span>&#160;        prev1[k] = j;</div>
<div class="line"><a name="l00342"></a><span class="lineno">  342</span>&#160;        <span class="keywordflow">if</span> (head1 == tail12)</div>
<div class="line"><a name="l00343"></a><span class="lineno">  343</span>&#160;                head1 = j;</div>
<div class="line"><a name="l00344"></a><span class="lineno">  344</span>&#160;</div>
<div class="line"><a name="l00345"></a><span class="lineno">  345</span>&#160;        <span class="keywordflow">return</span> j;</div>
<div class="line"><a name="l00346"></a><span class="lineno">  346</span>&#160;}</div>
<div class="line"><a name="l00347"></a><span class="lineno">  347</span>&#160;</div>
<div class="line"><a name="l00348"></a><span class="lineno">  348</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>D&gt;</div>
<div class="line"><a name="l00349"></a><span class="lineno"><a class="code" href="classTripleList.html#a4aa4d03626de0d2605366922b2bf06cc">  349</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classTripleList.html#a4aa4d03626de0d2605366922b2bf06cc">TripleList&lt;T, D&gt;::removeLevel1</a>(<span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00350"></a><span class="lineno">  350</span>&#160;        next1[prev1[j]] = next1[j];</div>
<div class="line"><a name="l00351"></a><span class="lineno">  351</span>&#160;        prev1[next1[j]] = prev1[j];</div>
<div class="line"><a name="l00352"></a><span class="lineno">  352</span>&#160;        <span class="keywordflow">if</span> (j == head1)</div>
<div class="line"><a name="l00353"></a><span class="lineno">  353</span>&#160;                head1 = next1[j];</div>
<div class="line"><a name="l00354"></a><span class="lineno">  354</span>&#160;        addFreeHead(j);</div>
<div class="line"><a name="l00355"></a><span class="lineno">  355</span>&#160;</div>
<div class="line"><a name="l00356"></a><span class="lineno">  356</span>&#160;        <span class="keywordflow">return</span> j;</div>
<div class="line"><a name="l00357"></a><span class="lineno">  357</span>&#160;}</div>
<div class="line"><a name="l00358"></a><span class="lineno">  358</span>&#160;</div>
<div class="line"><a name="l00359"></a><span class="lineno">  359</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>D&gt;</div>
<div class="line"><a name="l00360"></a><span class="lineno"><a class="code" href="classTripleList.html#a6f079bc4efae3b65aa33e4714772c653">  360</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classTripleList.html#a6f079bc4efae3b65aa33e4714772c653">TripleList&lt;T, D&gt;::removeLevel2</a>(<span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00361"></a><span class="lineno">  361</span>&#160;        <span class="keywordflow">if</span> (next2[j] == tail12)</div>
<div class="line"><a name="l00362"></a><span class="lineno">  362</span>&#160;                <span class="keywordflow">return</span> tail12;</div>
<div class="line"><a name="l00363"></a><span class="lineno">  363</span>&#160;</div>
<div class="line"><a name="l00364"></a><span class="lineno">  364</span>&#160;        j = next2[j];</div>
<div class="line"><a name="l00365"></a><span class="lineno">  365</span>&#160;        <span class="keywordtype">long</span> i = vert[j];</div>
<div class="line"><a name="l00366"></a><span class="lineno">  366</span>&#160;        vert[j] = next3[i];</div>
<div class="line"><a name="l00367"></a><span class="lineno">  367</span>&#160;</div>
<div class="line"><a name="l00368"></a><span class="lineno">  368</span>&#160;        <span class="keywordflow">if</span> (vert[j] == tail3) {</div>
<div class="line"><a name="l00369"></a><span class="lineno">  369</span>&#160;                next2[prev2[j]] = next2[j];</div>
<div class="line"><a name="l00370"></a><span class="lineno">  370</span>&#160;                prev2[next2[j]] = prev2[j];</div>
<div class="line"><a name="l00371"></a><span class="lineno">  371</span>&#160;                addFreeHead(j);</div>
<div class="line"><a name="l00372"></a><span class="lineno">  372</span>&#160;</div>
<div class="line"><a name="l00373"></a><span class="lineno">  373</span>&#160;                <span class="keywordflow">if</span> (next2[node1[j]] == tail12)</div>
<div class="line"><a name="l00374"></a><span class="lineno">  374</span>&#160;                        j = removeLevel1(node1[j]);</div>
<div class="line"><a name="l00375"></a><span class="lineno">  375</span>&#160;        }</div>
<div class="line"><a name="l00376"></a><span class="lineno">  376</span>&#160;</div>
<div class="line"><a name="l00377"></a><span class="lineno">  377</span>&#160;        <span class="keywordflow">return</span> i;</div>
<div class="line"><a name="l00378"></a><span class="lineno">  378</span>&#160;}</div>
<div class="line"><a name="l00379"></a><span class="lineno">  379</span>&#160;</div>
<div class="line"><a name="l00380"></a><span class="lineno">  380</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>D&gt;</div>
<div class="line"><a name="l00381"></a><span class="lineno"><a class="code" href="classTripleList.html#a5124ffe4c905c3b50123985cff8c3dc5">  381</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classTripleList.html#a5124ffe4c905c3b50123985cff8c3dc5">TripleList&lt;T, D&gt;::removeLevel3</a>(<span class="keywordtype">long</span> i) {</div>
<div class="line"><a name="l00382"></a><span class="lineno">  382</span>&#160;        <span class="keywordtype">long</span> j = node2[i];</div>
<div class="line"><a name="l00383"></a><span class="lineno">  383</span>&#160;        <span class="keywordtype">long</span> ret = node1[j];</div>
<div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160;        <span class="keywordflow">if</span> (vert[j] == i) {</div>
<div class="line"><a name="l00385"></a><span class="lineno">  385</span>&#160;                <span class="keywordflow">if</span> (vert[j] == tail3) {</div>
<div class="line"><a name="l00386"></a><span class="lineno">  386</span>&#160;                        next2[prev2[j]] = next2[j];</div>
<div class="line"><a name="l00387"></a><span class="lineno">  387</span>&#160;                        prev2[next2[j]] = prev2[j];</div>
<div class="line"><a name="l00388"></a><span class="lineno">  388</span>&#160;                        addFreeHead(j);</div>
<div class="line"><a name="l00389"></a><span class="lineno">  389</span>&#160;                }</div>
<div class="line"><a name="l00390"></a><span class="lineno">  390</span>&#160;                <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00391"></a><span class="lineno">  391</span>&#160;                        vert[j] = next3[i];</div>
<div class="line"><a name="l00392"></a><span class="lineno">  392</span>&#160;                        prev3[vert[j]] = tail3;</div>
<div class="line"><a name="l00393"></a><span class="lineno">  393</span>&#160;                }</div>
<div class="line"><a name="l00394"></a><span class="lineno">  394</span>&#160;        }</div>
<div class="line"><a name="l00395"></a><span class="lineno">  395</span>&#160;        <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00396"></a><span class="lineno">  396</span>&#160;                next3[prev3[i]] = next3[i];</div>
<div class="line"><a name="l00397"></a><span class="lineno">  397</span>&#160;                prev3[next3[i]] = prev3[i];</div>
<div class="line"><a name="l00398"></a><span class="lineno">  398</span>&#160;        }</div>
<div class="line"><a name="l00399"></a><span class="lineno">  399</span>&#160;</div>
<div class="line"><a name="l00400"></a><span class="lineno">  400</span>&#160;        <span class="keywordflow">return</span> ret;</div>
<div class="line"><a name="l00401"></a><span class="lineno">  401</span>&#160;}</div>
<div class="line"><a name="l00402"></a><span class="lineno">  402</span>&#160;</div>
<div class="line"><a name="l00403"></a><span class="lineno"><a class="code" href="ColoringHeuristic_8h.html#a4d397627f3e1fc3688431fac23b2de85">  403</a></span>&#160;<span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="ColoringHeuristic_8h.html#a4d397627f3e1fc3688431fac23b2de85">graphs_compar</a>(<span class="keyword">const</span> <span class="keywordtype">void</span>* a, <span class="keyword">const</span> <span class="keywordtype">void</span>* b, <span class="keywordtype">void</span> * arg) {</div>
<div class="line"><a name="l00404"></a><span class="lineno">  404</span>&#160;        <span class="keywordflow">return</span> ((<span class="keywordtype">long</span> *) arg)[*(<span class="keywordtype">long</span>*)a] - ((<span class="keywordtype">long</span> *) arg)[*(<span class="keywordtype">long</span>*)b];</div>
<div class="line"><a name="l00405"></a><span class="lineno">  405</span>&#160;}</div>
<div class="line"><a name="l00406"></a><span class="lineno">  406</span>&#160;</div>
<div class="line"><a name="l00407"></a><span class="lineno">  407</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>D&gt;</div>
<div class="line"><a name="l00408"></a><span class="lineno"><a class="code" href="classColoringHeuristic.html#aa54345bb1fc4a68dd9b135bdb2ecb098">  408</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classColoringHeuristic.html#aa54345bb1fc4a68dd9b135bdb2ecb098">ColoringHeuristic&lt;T, D&gt;::bucketSort</a>(<span class="keywordtype">long</span> * color, <span class="keywordtype">long</span> cmin, <span class="keywordtype">long</span> cmax, <span class="keywordtype">long</span> * R, <span class="keywordtype">long</span> r) {</div>
<div class="line"><a name="l00409"></a><span class="lineno">  409</span>&#160;        <span class="keywordtype">long</span> c = cmax - cmin + 1;</div>
<div class="line"><a name="l00410"></a><span class="lineno">  410</span>&#160;        <span class="keywordtype">long</span> b[c];</div>
<div class="line"><a name="l00411"></a><span class="lineno">  411</span>&#160;        <span class="keywordtype">long</span> next[r+1];</div>
<div class="line"><a name="l00412"></a><span class="lineno">  412</span>&#160;        <span class="keywordtype">long</span> v[r];</div>
<div class="line"><a name="l00413"></a><span class="lineno">  413</span>&#160;        <span class="keywordtype">long</span> i;</div>
<div class="line"><a name="l00414"></a><span class="lineno">  414</span>&#160;        <span class="keywordflow">for</span> (i = 0; i &lt; c; i++)</div>
<div class="line"><a name="l00415"></a><span class="lineno">  415</span>&#160;                b[i] = r;</div>
<div class="line"><a name="l00416"></a><span class="lineno">  416</span>&#160;        <span class="keywordflow">for</span> (i = 0; i &lt; r; i++) {</div>
<div class="line"><a name="l00417"></a><span class="lineno">  417</span>&#160;                next[i] = b[color[i]];</div>
<div class="line"><a name="l00418"></a><span class="lineno">  418</span>&#160;                b[color[i]-cmin] = i;</div>
<div class="line"><a name="l00419"></a><span class="lineno">  419</span>&#160;                v[i] = R[i];</div>
<div class="line"><a name="l00420"></a><span class="lineno">  420</span>&#160;        }</div>
<div class="line"><a name="l00421"></a><span class="lineno">  421</span>&#160;        <span class="keywordtype">long</span> j = 0,k;</div>
<div class="line"><a name="l00422"></a><span class="lineno">  422</span>&#160;        <span class="keywordflow">for</span> (i = 0; j &lt; r; i++) {</div>
<div class="line"><a name="l00423"></a><span class="lineno">  423</span>&#160;                k = b[i];</div>
<div class="line"><a name="l00424"></a><span class="lineno">  424</span>&#160;                <span class="keywordflow">while</span> (k &lt; r) {</div>
<div class="line"><a name="l00425"></a><span class="lineno">  425</span>&#160;                        R[j++] = v[k];</div>
<div class="line"><a name="l00426"></a><span class="lineno">  426</span>&#160;                        k = next[k];</div>
<div class="line"><a name="l00427"></a><span class="lineno">  427</span>&#160;                }</div>
<div class="line"><a name="l00428"></a><span class="lineno">  428</span>&#160;        }</div>
<div class="line"><a name="l00429"></a><span class="lineno">  429</span>&#160;}</div>
<div class="line"><a name="l00430"></a><span class="lineno">  430</span>&#160;</div>
<div class="line"><a name="l00431"></a><span class="lineno">  431</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>D&gt;</div>
<div class="line"><a name="l00432"></a><span class="lineno"><a class="code" href="classGreedy.html">  432</a></span>&#160;<span class="keyword">class </span><a class="code" href="classGreedy.html">Greedy</a> : <span class="keyword">public</span> <a class="code" href="classColoringHeuristic.html" title="This class encapsulates a set of algorithms to color a graph.">ColoringHeuristic</a>&lt;T, D&gt; {</div>
<div class="line"><a name="l00433"></a><span class="lineno"><a class="code" href="classGreedy.html#a5de685d57c405d29b034738d6d8cc568">  433</a></span>&#160;        <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="classColoringHeuristic.html" title="This class encapsulates a set of algorithms to color a graph.">ColoringHeuristic</a>;</div>
<div class="line"><a name="l00434"></a><span class="lineno">  434</span>&#160;</div>
<div class="line"><a name="l00435"></a><span class="lineno"><a class="code" href="classGreedy.html#aace8f452becc9799e389545e220dc4d4">  435</a></span>&#160;        <a class="code" href="classGreedy.html#aace8f452becc9799e389545e220dc4d4">Greedy</a>(<span class="keywordtype">long</span> <a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a>, <a class="code" href="classFactory.html">Factory</a>&lt;D&lt;T&gt; &gt; * f) : CoveringAlgorithm&lt;T, D&gt;(n, f) {};</div>
<div class="line"><a name="l00436"></a><span class="lineno">  436</span>&#160;        <a class="code" href="classGreedy.html#a8f1257143ba67407475e57a1268811c7">~Greedy</a>();</div>
<div class="line"><a name="l00437"></a><span class="lineno">  437</span>&#160;</div>
<div class="line"><a name="l00438"></a><span class="lineno">  438</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00439"></a><span class="lineno">  439</span>&#160;</div>
<div class="line"><a name="l00440"></a><span class="lineno">  440</span>&#160;        <span class="keywordtype">long</span> <a class="code" href="classGreedy.html#ae0d2d21ed0e4a01944051e79dfc75a1a">run</a>(<a class="code" href="classGraph.html">Graph</a>&lt;D&lt;T&gt; &gt; * g, <span class="keywordtype">long</span> * res, <span class="keywordtype">long</span> * R, <span class="keywordtype">long</span> r);</div>
<div class="line"><a name="l00441"></a><span class="lineno">  441</span>&#160;};</div>
<div class="line"><a name="l00442"></a><span class="lineno">  442</span>&#160;</div>
<div class="line"><a name="l00443"></a><span class="lineno">  443</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>D&gt;</div>
<div class="line"><a name="l00444"></a><span class="lineno"><a class="code" href="classColoringHeuristic.html#a7bfb89fa3681e587f3b3f52e5c8183b1">  444</a></span>&#160;<a class="code" href="classColoringHeuristic.html" title="This class encapsulates a set of algorithms to color a graph.">ColoringHeuristic&lt;T, D&gt;</a> * <a class="code" href="classColoringHeuristic.html#a7bfb89fa3681e587f3b3f52e5c8183b1" title="Made a greedy coloring of the subgraph induced by the vertexes in R, with the order that they appear ...">ColoringHeuristic&lt;T, D&gt;::greedy</a>(<span class="keywordtype">long</span> <a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a>, <a class="code" href="classFactory.html">Factory&lt;D&gt;</a> * <a class="code" href="classColoringHeuristic.html#a40cd35433cef882c6d01ba41ba8bb324">factory</a>) {</div>
<div class="line"><a name="l00445"></a><span class="lineno">  445</span>&#160;        <span class="keywordflow">return</span> <span class="keyword">new</span> <a class="code" href="classGreedy.html">Greedy&lt;T, D&gt;</a>(<a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a>, <a class="code" href="classColoringHeuristic.html#a40cd35433cef882c6d01ba41ba8bb324">factory</a>);</div>
<div class="line"><a name="l00446"></a><span class="lineno">  446</span>&#160;}</div>
<div class="line"><a name="l00447"></a><span class="lineno">  447</span>&#160;</div>
<div class="line"><a name="l00448"></a><span class="lineno">  448</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>D&gt;</div>
<div class="line"><a name="l00449"></a><span class="lineno"><a class="code" href="classGreedy.html#ae0d2d21ed0e4a01944051e79dfc75a1a">  449</a></span>&#160;<span class="keywordtype">long</span> <a class="code" href="classGreedy.html#ae0d2d21ed0e4a01944051e79dfc75a1a">Greedy&lt;T, D&gt;::run</a>(<a class="code" href="classGraph.html">Graph</a>&lt;D&lt;T&gt; &gt; * g, <span class="keywordtype">long</span> * res, <span class="keywordtype">long</span> * R, <span class="keywordtype">long</span> r) {</div>
<div class="line"><a name="l00450"></a><span class="lineno">  450</span>&#160;        <span class="keywordtype">long</span> i, v, co;</div>
<div class="line"><a name="l00451"></a><span class="lineno">  451</span>&#160;</div>
<div class="line"><a name="l00452"></a><span class="lineno">  452</span>&#160;        <span class="comment">//induced subgraph</span></div>
<div class="line"><a name="l00453"></a><span class="lineno">  453</span>&#160;        <a class="code" href="classColoringHeuristic.html#ae4cf7db5667d8d65aa6b7c41ee27ef60">bitR</a>-&gt;allToCompl();</div>
<div class="line"><a name="l00454"></a><span class="lineno">  454</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0 ; j &lt; r; j++)</div>
<div class="line"><a name="l00455"></a><span class="lineno">  455</span>&#160;                <a class="code" href="classColoringHeuristic.html#ae4cf7db5667d8d65aa6b7c41ee27ef60">bitR</a>-&gt;toSet(R[j]);</div>
<div class="line"><a name="l00456"></a><span class="lineno">  456</span>&#160;</div>
<div class="line"><a name="l00457"></a><span class="lineno">  457</span>&#160;        <span class="comment">//initialize the colors, each vetor represents the set of colors avaible for</span></div>
<div class="line"><a name="l00458"></a><span class="lineno">  458</span>&#160;        <span class="comment">//each vertex.</span></div>
<div class="line"><a name="l00459"></a><span class="lineno">  459</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0 ; j &lt; <a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a>; j++)</div>
<div class="line"><a name="l00460"></a><span class="lineno">  460</span>&#160;                <a class="code" href="classColoringHeuristic.html#a99bba05a6a6c8df2bc7ffb4f1f5aea9b">colors</a>[j]-&gt;allToCompl();</div>
<div class="line"><a name="l00461"></a><span class="lineno">  461</span>&#160;</div>
<div class="line"><a name="l00462"></a><span class="lineno">  462</span>&#160;        <span class="comment">//greedy coloring</span></div>
<div class="line"><a name="l00463"></a><span class="lineno">  463</span>&#160;        <span class="keywordflow">while</span> (i &lt; r) {</div>
<div class="line"><a name="l00464"></a><span class="lineno">  464</span>&#160;                <span class="comment">//in order visit each vertex of R</span></div>
<div class="line"><a name="l00465"></a><span class="lineno">  465</span>&#160;                v = R[i++];</div>
<div class="line"><a name="l00466"></a><span class="lineno">  466</span>&#160;                co = <a class="code" href="classColoringHeuristic.html#a99bba05a6a6c8df2bc7ffb4f1f5aea9b">colors</a>[v]-&gt;firstInCompl();</div>
<div class="line"><a name="l00467"></a><span class="lineno">  467</span>&#160;                <span class="comment">//determine its color</span></div>
<div class="line"><a name="l00468"></a><span class="lineno">  468</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0; j &lt; r; j++)</div>
<div class="line"><a name="l00469"></a><span class="lineno">  469</span>&#160;                        <span class="keywordflow">if</span> (R[j] == v)</div>
<div class="line"><a name="l00470"></a><span class="lineno">  470</span>&#160;                                res[j] = co;</div>
<div class="line"><a name="l00471"></a><span class="lineno">  471</span>&#160;</div>
<div class="line"><a name="l00472"></a><span class="lineno">  472</span>&#160;                <span class="comment">//remove the color to the possible colors of its neigbours</span></div>
<div class="line"><a name="l00473"></a><span class="lineno">  473</span>&#160;                <a class="code" href="classDirectlyAddressedSet_1_1Iterator.html" title="A general iterator to scan a DirectlyAddressedSet.">DirectlyAddressedSet::Iterator</a>* it = g-&gt;neig(v)-&gt;newIterator(<a class="code" href="classColoringHeuristic.html#ae4cf7db5667d8d65aa6b7c41ee27ef60">bitR</a>, <a class="code" href="classColoringHeuristic.html#ad51d1ebb6f77365b5737001d39b62324">andFilter</a>);</div>
<div class="line"><a name="l00474"></a><span class="lineno">  474</span>&#160;                <span class="keywordtype">long</span> iti = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00475"></a><span class="lineno">  475</span>&#160;                <span class="keywordtype">long</span> iu = g-&gt;neig(v)-&gt;universeSize();</div>
<div class="line"><a name="l00476"></a><span class="lineno">  476</span>&#160;                <span class="keywordflow">while</span>(iti &lt; iu) {</div>
<div class="line"><a name="l00477"></a><span class="lineno">  477</span>&#160;                        <a class="code" href="classColoringHeuristic.html#a99bba05a6a6c8df2bc7ffb4f1f5aea9b">colors</a>[iti]-&gt;toSet(co);</div>
<div class="line"><a name="l00478"></a><span class="lineno">  478</span>&#160;                        iti = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00479"></a><span class="lineno">  479</span>&#160;                }</div>
<div class="line"><a name="l00480"></a><span class="lineno">  480</span>&#160;        }</div>
<div class="line"><a name="l00481"></a><span class="lineno">  481</span>&#160;</div>
<div class="line"><a name="l00482"></a><span class="lineno">  482</span>&#160;        <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00483"></a><span class="lineno">  483</span>&#160;}</div>
<div class="line"><a name="l00484"></a><span class="lineno">  484</span>&#160;</div>
<div class="line"><a name="l00491"></a><span class="lineno">  491</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>D&gt;</div>
<div class="line"><a name="l00492"></a><span class="lineno"><a class="code" href="classDsatur.html">  492</a></span>&#160;<span class="keyword">class </span><a class="code" href="classDsatur.html">Dsatur</a> : <span class="keyword">public</span> <a class="code" href="classColoringHeuristic.html" title="This class encapsulates a set of algorithms to color a graph.">ColoringHeuristic</a>&lt;T, D&gt;, <span class="keyword">private</span> <a class="code" href="classTripleList.html">TripleList</a>&lt;T, D&gt; {</div>
<div class="line"><a name="l00493"></a><span class="lineno"><a class="code" href="classDsatur.html#a5de685d57c405d29b034738d6d8cc568">  493</a></span>&#160;        <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="classColoringHeuristic.html" title="This class encapsulates a set of algorithms to color a graph.">ColoringHeuristic</a>;</div>
<div class="line"><a name="l00494"></a><span class="lineno">  494</span>&#160;</div>
<div class="line"><a name="l00495"></a><span class="lineno"><a class="code" href="classDsatur.html#ac8ca739dcd100006ec9bea8280248a0e">  495</a></span>&#160;        <a class="code" href="classDsatur.html#ac8ca739dcd100006ec9bea8280248a0e">Dsatur</a>(<span class="keywordtype">long</span> <a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a>, <a class="code" href="classFactory.html">Factory</a>&lt;D&lt;T&gt; &gt; * f) : CoveringAlgorithm&lt;T, D&gt;(n, f), <a class="code" href="classTripleList.html">TripleList</a>&lt;T, D&gt;(n, f) {};</div>
<div class="line"><a name="l00496"></a><span class="lineno">  496</span>&#160;        <a class="code" href="classDsatur.html#a5ed99f28027fea96bbbbed0094537694">~Dsatur</a>();</div>
<div class="line"><a name="l00497"></a><span class="lineno">  497</span>&#160;</div>
<div class="line"><a name="l00498"></a><span class="lineno">  498</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00499"></a><span class="lineno">  499</span>&#160;</div>
<div class="line"><a name="l00500"></a><span class="lineno">  500</span>&#160;        <span class="keywordtype">long</span> <a class="code" href="classDsatur.html#af30bebb51dc3aa571543fdb1d5507c10">run</a>(<a class="code" href="classGraph.html">Graph</a>&lt;D&lt;T&gt; &gt; * g, <span class="keywordtype">long</span> * res, <span class="keywordtype">long</span> * R, <span class="keywordtype">long</span> r);</div>
<div class="line"><a name="l00501"></a><span class="lineno">  501</span>&#160;};</div>
<div class="line"><a name="l00502"></a><span class="lineno">  502</span>&#160;</div>
<div class="line"><a name="l00503"></a><span class="lineno">  503</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>D&gt;</div>
<div class="line"><a name="l00504"></a><span class="lineno"><a class="code" href="classColoringHeuristic.html#a449990b4b90c04a0ba4d0cf55f7f9280">  504</a></span>&#160;<a class="code" href="classColoringHeuristic.html" title="This class encapsulates a set of algorithms to color a graph.">ColoringHeuristic&lt;T, D&gt;</a> * <a class="code" href="classColoringHeuristic.html#a449990b4b90c04a0ba4d0cf55f7f9280" title="Determines a greedy coloring of the subgraph induced by the specified vertices using the Dsatur algor...">ColoringHeuristic&lt;T, D&gt;::dsatur</a>(<span class="keywordtype">long</span> <a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a>, <a class="code" href="classFactory.html">Factory&lt;D&gt;</a> * <a class="code" href="classColoringHeuristic.html#a40cd35433cef882c6d01ba41ba8bb324">factory</a>) {</div>
<div class="line"><a name="l00505"></a><span class="lineno">  505</span>&#160;        <span class="keywordflow">return</span> <span class="keyword">new</span> <a class="code" href="classDsatur.html">Dsatur&lt;T, D&gt;</a>(<a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a>, <a class="code" href="classColoringHeuristic.html#a40cd35433cef882c6d01ba41ba8bb324">factory</a>);</div>
<div class="line"><a name="l00506"></a><span class="lineno">  506</span>&#160;}</div>
<div class="line"><a name="l00507"></a><span class="lineno">  507</span>&#160;</div>
<div class="line"><a name="l00508"></a><span class="lineno">  508</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>D&gt;</div>
<div class="line"><a name="l00509"></a><span class="lineno"><a class="code" href="classDsatur.html#af30bebb51dc3aa571543fdb1d5507c10">  509</a></span>&#160;<span class="keywordtype">long</span> <a class="code" href="classDsatur.html#af30bebb51dc3aa571543fdb1d5507c10">Dsatur&lt;T, D&gt;::run</a>(<a class="code" href="classGraph.html">Graph</a>&lt;D&lt;T&gt; &gt; * g, <span class="keywordtype">long</span> * res, <span class="keywordtype">long</span> * R, <span class="keywordtype">long</span> r) {</div>
<div class="line"><a name="l00510"></a><span class="lineno">  510</span>&#160;        <span class="keywordtype">long</span> v, u;</div>
<div class="line"><a name="l00511"></a><span class="lineno">  511</span>&#160;</div>
<div class="line"><a name="l00512"></a><span class="lineno">  512</span>&#160;        <span class="comment">//creates a bit map to the elements in R to be used as a filter</span></div>
<div class="line"><a name="l00513"></a><span class="lineno">  513</span>&#160;        <a class="code" href="classColoringHeuristic.html#ae4cf7db5667d8d65aa6b7c41ee27ef60">bitR</a>-&gt;allToCompl();</div>
<div class="line"><a name="l00514"></a><span class="lineno">  514</span>&#160;        <span class="keywordtype">long</span> j;</div>
<div class="line"><a name="l00515"></a><span class="lineno">  515</span>&#160;        <span class="keywordflow">for</span> (j = 0 ; j &lt; r; j++) {</div>
<div class="line"><a name="l00516"></a><span class="lineno">  516</span>&#160;                <a class="code" href="classColoringHeuristic.html#ae4cf7db5667d8d65aa6b7c41ee27ef60">bitR</a>-&gt;toSet(R[j]);</div>
<div class="line"><a name="l00517"></a><span class="lineno">  517</span>&#160;                <a class="code" href="classColoringHeuristic.html#a2dce80a62997557dc676eb05565c5379" title="inverse of input mappings">invR</a>[R[j]] = j;</div>
<div class="line"><a name="l00518"></a><span class="lineno">  518</span>&#160;        }</div>
<div class="line"><a name="l00519"></a><span class="lineno">  519</span>&#160;</div>
<div class="line"><a name="l00520"></a><span class="lineno">  520</span>&#160;        <span class="comment">//initializes the vector of degrees</span></div>
<div class="line"><a name="l00521"></a><span class="lineno">  521</span>&#160;        <span class="keywordtype">long</span> maxdeg = 0, mindeg = <a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a>;</div>
<div class="line"><a name="l00522"></a><span class="lineno">  522</span>&#160;        <span class="keywordflow">for</span> (j = 0; j &lt; r; j++) {</div>
<div class="line"><a name="l00523"></a><span class="lineno">  523</span>&#160;                <a class="code" href="classColoringHeuristic.html#a3af684edbb71a7a430e05e3e79ec938c">degR</a>-&gt;allToCompl();</div>
<div class="line"><a name="l00524"></a><span class="lineno">  524</span>&#160;                <a class="code" href="classBitMapDirectlyAddressedSets.html#a1a8f42e33423c79e0b20174797381286" title="Implementation of the intersection operation using filtered iteration and bit parallelism.">BitMapDirectlyAddressedSets&lt;T&gt;::intersectOf</a>(<a class="code" href="classColoringHeuristic.html#a3af684edbb71a7a430e05e3e79ec938c">degR</a>, <a class="code" href="classColoringHeuristic.html#ae4cf7db5667d8d65aa6b7c41ee27ef60">bitR</a>, g-&gt;neig(R[j]));</div>
<div class="line"><a name="l00525"></a><span class="lineno">  525</span>&#160;                key3[j] = <a class="code" href="classColoringHeuristic.html#a3af684edbb71a7a430e05e3e79ec938c">degR</a>-&gt;cardOfSet();</div>
<div class="line"><a name="l00526"></a><span class="lineno">  526</span>&#160;                <span class="keywordflow">if</span> (key3[j] &gt; maxdeg)</div>
<div class="line"><a name="l00527"></a><span class="lineno">  527</span>&#160;                        maxdeg = key3[j];</div>
<div class="line"><a name="l00528"></a><span class="lineno">  528</span>&#160;                <span class="keywordflow">if</span> (key3[j] &lt; mindeg)</div>
<div class="line"><a name="l00529"></a><span class="lineno">  529</span>&#160;                        mindeg = key3[j];</div>
<div class="line"><a name="l00530"></a><span class="lineno">  530</span>&#160;                res[j] = j;</div>
<div class="line"><a name="l00531"></a><span class="lineno">  531</span>&#160;        }</div>
<div class="line"><a name="l00532"></a><span class="lineno">  532</span>&#160;</div>
<div class="line"><a name="l00533"></a><span class="lineno">  533</span>&#160;        <span class="comment">// sorts vertices according to degrees</span></div>
<div class="line"><a name="l00534"></a><span class="lineno">  534</span>&#160;        <a class="code" href="classColoringHeuristic.html#aa54345bb1fc4a68dd9b135bdb2ecb098">ColoringHeuristic&lt;T, D&gt;::bucketSort</a>(key3, mindeg, maxdeg, res, r);</div>
<div class="line"><a name="l00535"></a><span class="lineno">  535</span>&#160;        head1 = removeFreeHead();</div>
<div class="line"><a name="l00536"></a><span class="lineno">  536</span>&#160;        next2[head1] = tail;</div>
<div class="line"><a name="l00537"></a><span class="lineno">  537</span>&#160;        key1[head1] = 0;</div>
<div class="line"><a name="l00538"></a><span class="lineno">  538</span>&#160;</div>
<div class="line"><a name="l00539"></a><span class="lineno">  539</span>&#160;        v = insertDeg(head1, R[res[0]]);</div>
<div class="line"><a name="l00540"></a><span class="lineno">  540</span>&#160;        node1[v] = head1;</div>
<div class="line"><a name="l00541"></a><span class="lineno">  541</span>&#160;        <span class="keywordflow">for</span> (j = 1; j &lt; r; j++) {</div>
<div class="line"><a name="l00542"></a><span class="lineno">  542</span>&#160;                v = insertDeg(prev2[v], R[res[j]]);</div>
<div class="line"><a name="l00543"></a><span class="lineno">  543</span>&#160;                node1[v] = head1;</div>
<div class="line"><a name="l00544"></a><span class="lineno">  544</span>&#160;        }</div>
<div class="line"><a name="l00545"></a><span class="lineno">  545</span>&#160;</div>
<div class="line"><a name="l00546"></a><span class="lineno">  546</span>&#160;        <span class="comment">//initialize the vector of colors</span></div>
<div class="line"><a name="l00547"></a><span class="lineno">  547</span>&#160;        <span class="keywordflow">for</span> (j = 0 ; j &lt; r; j++)</div>
<div class="line"><a name="l00548"></a><span class="lineno">  548</span>&#160;                <a class="code" href="classColoringHeuristic.html#a99bba05a6a6c8df2bc7ffb4f1f5aea9b">colors</a>[j]-&gt;allToCompl();</div>
<div class="line"><a name="l00549"></a><span class="lineno">  549</span>&#160;</div>
<div class="line"><a name="l00550"></a><span class="lineno">  550</span>&#160;        <span class="comment">//coloring</span></div>
<div class="line"><a name="l00551"></a><span class="lineno">  551</span>&#160;        <span class="keywordtype">long</span> i = r, color;</div>
<div class="line"><a name="l00552"></a><span class="lineno">  552</span>&#160;        <span class="keywordflow">while</span> (--i &gt;= 0) {</div>
<div class="line"><a name="l00553"></a><span class="lineno">  553</span>&#160;                <span class="comment">//color the first in the heap</span></div>
<div class="line"><a name="l00554"></a><span class="lineno">  554</span>&#160;                v = removeDeg(head1);</div>
<div class="line"><a name="l00555"></a><span class="lineno">  555</span>&#160;                color = <a class="code" href="classColoringHeuristic.html#a99bba05a6a6c8df2bc7ffb4f1f5aea9b">colors</a>[v]-&gt;firstInCompl();</div>
<div class="line"><a name="l00556"></a><span class="lineno">  556</span>&#160;                res[<a class="code" href="classColoringHeuristic.html#a2dce80a62997557dc676eb05565c5379" title="inverse of input mappings">invR</a>[v]] = color;</div>
<div class="line"><a name="l00557"></a><span class="lineno">  557</span>&#160;</div>
<div class="line"><a name="l00558"></a><span class="lineno">  558</span>&#160;                <span class="comment">//update the saturation degree of its neighbors</span></div>
<div class="line"><a name="l00559"></a><span class="lineno">  559</span>&#160;                <a class="code" href="classDirectlyAddressedSet_1_1Iterator.html" title="A general iterator to scan a DirectlyAddressedSet.">DirectlyAddressedSet::Iterator</a>* it = g-&gt;neig(v)-&gt;newIterator(<a class="code" href="classColoringHeuristic.html#ae4cf7db5667d8d65aa6b7c41ee27ef60">bitR</a>, <a class="code" href="classColoringHeuristic.html#ad51d1ebb6f77365b5737001d39b62324">andFilter</a>);</div>
<div class="line"><a name="l00560"></a><span class="lineno">  560</span>&#160;                u = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00561"></a><span class="lineno">  561</span>&#160;                <span class="keywordtype">long</span> iu = g-&gt;neig(v)-&gt;universeSize();</div>
<div class="line"><a name="l00562"></a><span class="lineno">  562</span>&#160;                <span class="keywordflow">while</span> (u &lt; iu) {</div>
<div class="line"><a name="l00563"></a><span class="lineno">  563</span>&#160;                        <span class="keywordtype">long</span> w;</div>
<div class="line"><a name="l00564"></a><span class="lineno">  564</span>&#160;                        <span class="keywordflow">if</span> (!<a class="code" href="classColoringHeuristic.html#a99bba05a6a6c8df2bc7ffb4f1f5aea9b">colors</a>[u]-&gt;isInSet(color)) {</div>
<div class="line"><a name="l00565"></a><span class="lineno">  565</span>&#160;                                <a class="code" href="classColoringHeuristic.html#a99bba05a6a6c8df2bc7ffb4f1f5aea9b">colors</a>[u]-&gt;toSet(color);</div>
<div class="line"><a name="l00566"></a><span class="lineno">  566</span>&#160;                                v = removeLevel3(u);</div>
<div class="line"><a name="l00567"></a><span class="lineno">  567</span>&#160;                                w = next1[v];</div>
<div class="line"><a name="l00568"></a><span class="lineno">  568</span>&#160;                                <span class="keywordtype">long</span> s = key1[v];</div>
<div class="line"><a name="l00569"></a><span class="lineno">  569</span>&#160;                                <span class="keywordflow">if</span> (next2[v] == tail12)</div>
<div class="line"><a name="l00570"></a><span class="lineno">  570</span>&#160;                                        removeLevel1(v);</div>
<div class="line"><a name="l00571"></a><span class="lineno">  571</span>&#160;                                <span class="keywordflow">if</span> (w == tail12 || key1[w] &gt; s+1) {</div>
<div class="line"><a name="l00572"></a><span class="lineno">  572</span>&#160;                                        w = insertLevel1Before(w);</div>
<div class="line"><a name="l00573"></a><span class="lineno">  573</span>&#160;                                        next2[w] = tail12;</div>
<div class="line"><a name="l00574"></a><span class="lineno">  574</span>&#160;                                        key1[w] = s+1;</div>
<div class="line"><a name="l00575"></a><span class="lineno">  575</span>&#160;                                }</div>
<div class="line"><a name="l00576"></a><span class="lineno">  576</span>&#160;                        }</div>
<div class="line"><a name="l00577"></a><span class="lineno">  577</span>&#160;                        <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00578"></a><span class="lineno">  578</span>&#160;                                w = prev2[node2[u]];</div>
<div class="line"><a name="l00579"></a><span class="lineno">  579</span>&#160;                                removeLevel3(u);</div>
<div class="line"><a name="l00580"></a><span class="lineno">  580</span>&#160;                        }</div>
<div class="line"><a name="l00581"></a><span class="lineno">  581</span>&#160;                        key3[u]--;</div>
<div class="line"><a name="l00582"></a><span class="lineno">  582</span>&#160;                        insertLevel2(w, u);</div>
<div class="line"><a name="l00583"></a><span class="lineno">  583</span>&#160;                        u = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00584"></a><span class="lineno">  584</span>&#160;                }</div>
<div class="line"><a name="l00585"></a><span class="lineno">  585</span>&#160;                <span class="keyword">delete</span> it;</div>
<div class="line"><a name="l00586"></a><span class="lineno">  586</span>&#160;        }</div>
<div class="line"><a name="l00587"></a><span class="lineno">  587</span>&#160;</div>
<div class="line"><a name="l00588"></a><span class="lineno">  588</span>&#160;        <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00589"></a><span class="lineno">  589</span>&#160;}</div>
<div class="line"><a name="l00590"></a><span class="lineno">  590</span>&#160;</div>
<div class="line"><a name="l00597"></a><span class="lineno">  597</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>D&gt;</div>
<div class="line"><a name="l00598"></a><span class="lineno"><a class="code" href="classMCR.html">  598</a></span>&#160;<span class="keyword">class </span><a class="code" href="classMCR.html">MCR</a> : <span class="keyword">public</span> <a class="code" href="classColoringHeuristic.html" title="This class encapsulates a set of algorithms to color a graph.">ColoringHeuristic</a>&lt;T, D&gt; {</div>
<div class="line"><a name="l00599"></a><span class="lineno"><a class="code" href="classMCR.html#a5de685d57c405d29b034738d6d8cc568">  599</a></span>&#160;        <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="classColoringHeuristic.html" title="This class encapsulates a set of algorithms to color a graph.">ColoringHeuristic</a>;</div>
<div class="line"><a name="l00600"></a><span class="lineno">  600</span>&#160;</div>
<div class="line"><a name="l00601"></a><span class="lineno"><a class="code" href="classMCR.html#afbe9eb1e64079ff706146d150df69c54">  601</a></span>&#160;        <a class="code" href="classMCR.html#afbe9eb1e64079ff706146d150df69c54">MCR</a>(<span class="keywordtype">long</span> <a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a>, <a class="code" href="classFactory.html">Factory</a>&lt;D&lt;T&gt; &gt; * f) : CoveringAlgorithm&lt;T, D&gt;(n, f) {};</div>
<div class="line"><a name="l00602"></a><span class="lineno">  602</span>&#160;        <a class="code" href="classMCR.html#a67a36a0dcdd9f104e48e2827378c7e52">~MCR</a>();</div>
<div class="line"><a name="l00603"></a><span class="lineno">  603</span>&#160;</div>
<div class="line"><a name="l00604"></a><span class="lineno">  604</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00605"></a><span class="lineno">  605</span>&#160;</div>
<div class="line"><a name="l00606"></a><span class="lineno">  606</span>&#160;        <span class="keywordtype">long</span> <a class="code" href="classMCR.html#a36b25e017c31dc53258c0ec36191cb06">run</a>(<a class="code" href="classGraph.html">Graph</a>&lt;D&lt;T&gt; &gt; * g, <span class="keywordtype">long</span> * res, <span class="keywordtype">long</span> * R, <span class="keywordtype">long</span> r);</div>
<div class="line"><a name="l00607"></a><span class="lineno">  607</span>&#160;};</div>
<div class="line"><a name="l00608"></a><span class="lineno">  608</span>&#160;</div>
<div class="line"><a name="l00609"></a><span class="lineno">  609</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>D&gt;</div>
<div class="line"><a name="l00610"></a><span class="lineno"><a class="code" href="classColoringHeuristic.html#a3daa607fd5e566bb6f9b7317aec0120c">  610</a></span>&#160;<a class="code" href="classColoringHeuristic.html" title="This class encapsulates a set of algorithms to color a graph.">ColoringHeuristic&lt;T, D&gt;</a> * <a class="code" href="classColoringHeuristic.html#a3daa607fd5e566bb6f9b7317aec0120c" title="Cover the vertexes of the graph according its degree and the degree of its neighbours.">ColoringHeuristic&lt;T, D&gt;::mcr</a>(<span class="keywordtype">long</span> <a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a>, <a class="code" href="classFactory.html">Factory&lt;D&gt;</a> * <a class="code" href="classColoringHeuristic.html#a40cd35433cef882c6d01ba41ba8bb324">factory</a>) {</div>
<div class="line"><a name="l00611"></a><span class="lineno">  611</span>&#160;        <span class="keywordflow">return</span> <span class="keyword">new</span> <a class="code" href="classMCR.html">MCR&lt;T, D&gt;</a>(<a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a>, <a class="code" href="classColoringHeuristic.html#a40cd35433cef882c6d01ba41ba8bb324">factory</a>);</div>
<div class="line"><a name="l00612"></a><span class="lineno">  612</span>&#160;}</div>
<div class="line"><a name="l00613"></a><span class="lineno">  613</span>&#160;</div>
<div class="line"><a name="l00614"></a><span class="lineno">  614</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>D&gt;</div>
<div class="line"><a name="l00615"></a><span class="lineno"><a class="code" href="classMCR.html#a36b25e017c31dc53258c0ec36191cb06">  615</a></span>&#160;<span class="keywordtype">long</span> <a class="code" href="classMCR.html#a36b25e017c31dc53258c0ec36191cb06">MCR&lt;T, D&gt;::run</a>(<a class="code" href="classGraph.html">Graph</a>&lt;D&lt;T&gt; &gt; * g, <span class="keywordtype">long</span> * res, <span class="keywordtype">long</span> * R, <span class="keywordtype">long</span> r) {</div>
<div class="line"><a name="l00616"></a><span class="lineno">  616</span>&#160;        <span class="keywordtype">long</span> v, u;</div>
<div class="line"><a name="l00617"></a><span class="lineno">  617</span>&#160;</div>
<div class="line"><a name="l00618"></a><span class="lineno">  618</span>&#160;        <span class="comment">//creates a bit map to the elements in R to be used as a filter</span></div>
<div class="line"><a name="l00619"></a><span class="lineno">  619</span>&#160;        <a class="code" href="classColoringHeuristic.html#ae4cf7db5667d8d65aa6b7c41ee27ef60">bitR</a>-&gt;allToCompl();</div>
<div class="line"><a name="l00620"></a><span class="lineno">  620</span>&#160;        <span class="keywordtype">long</span> j;</div>
<div class="line"><a name="l00621"></a><span class="lineno">  621</span>&#160;        <span class="keywordflow">for</span> (j = 0 ; j &lt; r; j++) {</div>
<div class="line"><a name="l00622"></a><span class="lineno">  622</span>&#160;                <a class="code" href="classColoringHeuristic.html#ae4cf7db5667d8d65aa6b7c41ee27ef60">bitR</a>-&gt;toSet(R[j]);</div>
<div class="line"><a name="l00623"></a><span class="lineno">  623</span>&#160;                <a class="code" href="classColoringHeuristic.html#a2dce80a62997557dc676eb05565c5379" title="inverse of input mappings">invR</a>[R[j]] = j;</div>
<div class="line"><a name="l00624"></a><span class="lineno">  624</span>&#160;        }</div>
<div class="line"><a name="l00625"></a><span class="lineno">  625</span>&#160;</div>
<div class="line"><a name="l00626"></a><span class="lineno">  626</span>&#160;        <span class="comment">//initializes the vector of degrees</span></div>
<div class="line"><a name="l00627"></a><span class="lineno">  627</span>&#160;        <span class="keywordflow">for</span> (j = 0; j &lt; r; j++) {</div>
<div class="line"><a name="l00628"></a><span class="lineno">  628</span>&#160;                <a class="code" href="classColoringHeuristic.html#a3af684edbb71a7a430e05e3e79ec938c">degR</a>-&gt;allToCompl();</div>
<div class="line"><a name="l00629"></a><span class="lineno">  629</span>&#160;                <a class="code" href="classBitMapDirectlyAddressedSets.html#a1a8f42e33423c79e0b20174797381286" title="Implementation of the intersection operation using filtered iteration and bit parallelism.">BitMapDirectlyAddressedSets&lt;T&gt;::intersectOf</a>(<a class="code" href="classColoringHeuristic.html#a3af684edbb71a7a430e05e3e79ec938c">degR</a>, <a class="code" href="classColoringHeuristic.html#ae4cf7db5667d8d65aa6b7c41ee27ef60">bitR</a>, g-&gt;neig(R[j]));</div>
<div class="line"><a name="l00630"></a><span class="lineno">  630</span>&#160;                removeFree(j);</div>
<div class="line"><a name="l00631"></a><span class="lineno">  631</span>&#160;                key1[j] = <a class="code" href="classColoringHeuristic.html#a3af684edbb71a7a430e05e3e79ec938c">degR</a>-&gt;cardOfSet();</div>
<div class="line"><a name="l00632"></a><span class="lineno">  632</span>&#160;        }</div>
<div class="line"><a name="l00633"></a><span class="lineno">  633</span>&#160;</div>
<div class="line"><a name="l00634"></a><span class="lineno">  634</span>&#160;        <span class="comment">//initializes the vector of degrees</span></div>
<div class="line"><a name="l00635"></a><span class="lineno">  635</span>&#160;        <span class="keywordtype">long</span> maxdeg = 0, mindeg = <a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a>*<a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a>;</div>
<div class="line"><a name="l00636"></a><span class="lineno">  636</span>&#160;        <span class="keywordflow">for</span> (j = 0; j &lt; r; j++) {</div>
<div class="line"><a name="l00637"></a><span class="lineno">  637</span>&#160;                <a class="code" href="classColoringHeuristic.html#a3af684edbb71a7a430e05e3e79ec938c">degR</a>-&gt;allToCompl();</div>
<div class="line"><a name="l00638"></a><span class="lineno">  638</span>&#160;                <a class="code" href="classDirectlyAddressedSet_1_1Iterator.html" title="A general iterator to scan a DirectlyAddressedSet.">DirectlyAddressedSet::Iterator</a>* it = <a class="code" href="classColoringHeuristic.html#ae4cf7db5667d8d65aa6b7c41ee27ef60">bitR</a>-&gt;newIterator(g-&gt;neig(R[j]), <a class="code" href="classColoringHeuristic.html#ad51d1ebb6f77365b5737001d39b62324">andFilter</a>);</div>
<div class="line"><a name="l00639"></a><span class="lineno">  639</span>&#160;                key3[j] = 0;</div>
<div class="line"><a name="l00640"></a><span class="lineno">  640</span>&#160;                u = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00641"></a><span class="lineno">  641</span>&#160;                <span class="keywordtype">long</span> iu = g-&gt;neig(v)-&gt;universeSize();</div>
<div class="line"><a name="l00642"></a><span class="lineno">  642</span>&#160;                <span class="keywordflow">while</span> (u &lt; iu) {</div>
<div class="line"><a name="l00643"></a><span class="lineno">  643</span>&#160;                        key3[j] += key1[u];</div>
<div class="line"><a name="l00644"></a><span class="lineno">  644</span>&#160;                        u = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00645"></a><span class="lineno">  645</span>&#160;                }</div>
<div class="line"><a name="l00646"></a><span class="lineno">  646</span>&#160;                <span class="keywordflow">if</span> (key3[j] &gt; maxdeg)</div>
<div class="line"><a name="l00647"></a><span class="lineno">  647</span>&#160;                        maxdeg = key3[j];</div>
<div class="line"><a name="l00648"></a><span class="lineno">  648</span>&#160;                <span class="keywordflow">if</span> (key3[j] &lt; mindeg)</div>
<div class="line"><a name="l00649"></a><span class="lineno">  649</span>&#160;                        mindeg = key3[j];</div>
<div class="line"><a name="l00650"></a><span class="lineno">  650</span>&#160;                res[j] = j;</div>
<div class="line"><a name="l00651"></a><span class="lineno">  651</span>&#160;        }</div>
<div class="line"><a name="l00652"></a><span class="lineno">  652</span>&#160;</div>
<div class="line"><a name="l00653"></a><span class="lineno">  653</span>&#160;        <span class="comment">// sorts vertices according to degrees</span></div>
<div class="line"><a name="l00654"></a><span class="lineno">  654</span>&#160;        <a class="code" href="classColoringHeuristic.html#aa54345bb1fc4a68dd9b135bdb2ecb098">ColoringHeuristic&lt;T, D&gt;::bucketSort</a>(satdeg, mindeg, maxdeg, res, r);</div>
<div class="line"><a name="l00655"></a><span class="lineno">  655</span>&#160;        head1 = removeFree(res[0]);</div>
<div class="line"><a name="l00656"></a><span class="lineno">  656</span>&#160;        next2[head1] = tail12;</div>
<div class="line"><a name="l00657"></a><span class="lineno">  657</span>&#160;        v = insertLevel2(head1, R[res[0]]);</div>
<div class="line"><a name="l00658"></a><span class="lineno">  658</span>&#160;        node1[v] = head1;</div>
<div class="line"><a name="l00659"></a><span class="lineno">  659</span>&#160;        <span class="keywordflow">for</span> (j = 1; j &lt; r; j++) {</div>
<div class="line"><a name="l00660"></a><span class="lineno">  660</span>&#160;                <span class="keywordflow">if</span> ()</div>
<div class="line"><a name="l00661"></a><span class="lineno">  661</span>&#160;                v = insertDeg(prevdeg[v], R[res[j]]);</div>
<div class="line"><a name="l00662"></a><span class="lineno">  662</span>&#160;                satnode[v] = sathead;</div>
<div class="line"><a name="l00663"></a><span class="lineno">  663</span>&#160;        }</div>
<div class="line"><a name="l00664"></a><span class="lineno">  664</span>&#160;</div>
<div class="line"><a name="l00665"></a><span class="lineno">  665</span>&#160;        <span class="comment">//coloring</span></div>
<div class="line"><a name="l00666"></a><span class="lineno">  666</span>&#160;        <span class="keywordtype">long</span> i = r;</div>
<div class="line"><a name="l00667"></a><span class="lineno">  667</span>&#160;        <span class="keywordflow">while</span> (--i &gt;= 0) {</div>
<div class="line"><a name="l00668"></a><span class="lineno">  668</span>&#160;                <span class="comment">//color the first in the heap</span></div>
<div class="line"><a name="l00669"></a><span class="lineno">  669</span>&#160;                v = removeDeg(sathead);</div>
<div class="line"><a name="l00670"></a><span class="lineno">  670</span>&#160;                res[<a class="code" href="classColoringHeuristic.html#a2dce80a62997557dc676eb05565c5379" title="inverse of input mappings">invR</a>[v]] = i;</div>
<div class="line"><a name="l00671"></a><span class="lineno">  671</span>&#160;</div>
<div class="line"><a name="l00672"></a><span class="lineno">  672</span>&#160;                <span class="comment">//update the saturation degree of its neighbors</span></div>
<div class="line"><a name="l00673"></a><span class="lineno">  673</span>&#160;                <a class="code" href="classDirectlyAddressedSet_1_1Iterator.html" title="A general iterator to scan a DirectlyAddressedSet.">DirectlyAddressedSet::Iterator</a>* it = g-&gt;neig(v)-&gt;newIterator(<a class="code" href="classColoringHeuristic.html#ae4cf7db5667d8d65aa6b7c41ee27ef60">bitR</a>, <a class="code" href="classColoringHeuristic.html#ad51d1ebb6f77365b5737001d39b62324">andFilter</a>);</div>
<div class="line"><a name="l00674"></a><span class="lineno">  674</span>&#160;                u = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00675"></a><span class="lineno">  675</span>&#160;                <span class="keywordtype">long</span> iu = g-&gt;neig(v)-&gt;universeSize();</div>
<div class="line"><a name="l00676"></a><span class="lineno">  676</span>&#160;                <span class="keywordflow">while</span> (u &lt; iu) {</div>
<div class="line"><a name="l00677"></a><span class="lineno">  677</span>&#160;                        <span class="keywordtype">long</span> w;</div>
<div class="line"><a name="l00678"></a><span class="lineno">  678</span>&#160;                        v = removeVert(u);</div>
<div class="line"><a name="l00679"></a><span class="lineno">  679</span>&#160;                        w = nextsat[v];</div>
<div class="line"><a name="l00680"></a><span class="lineno">  680</span>&#160;                        <span class="keywordtype">long</span> s = satdeg[v];</div>
<div class="line"><a name="l00681"></a><span class="lineno">  681</span>&#160;                        <span class="keywordflow">if</span> (nextdeg[v] == tail)</div>
<div class="line"><a name="l00682"></a><span class="lineno">  682</span>&#160;                                removeSat(v);</div>
<div class="line"><a name="l00683"></a><span class="lineno">  683</span>&#160;                        <span class="keywordflow">if</span> (w == tail || satdeg[w] &lt; s-1) {</div>
<div class="line"><a name="l00684"></a><span class="lineno">  684</span>&#160;                                w = insertSatBefore(w);</div>
<div class="line"><a name="l00685"></a><span class="lineno">  685</span>&#160;                                nextdeg[w] = tail;</div>
<div class="line"><a name="l00686"></a><span class="lineno">  686</span>&#160;                                satdeg[w] = s-1;</div>
<div class="line"><a name="l00687"></a><span class="lineno">  687</span>&#160;                        }</div>
<div class="line"><a name="l00688"></a><span class="lineno">  688</span>&#160;                        <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00689"></a><span class="lineno">  689</span>&#160;                                w = prevdeg[degnode[u]];</div>
<div class="line"><a name="l00690"></a><span class="lineno">  690</span>&#160;                                removeVert(u);</div>
<div class="line"><a name="l00691"></a><span class="lineno">  691</span>&#160;                        }</div>
<div class="line"><a name="l00692"></a><span class="lineno">  692</span>&#160;                        degree[u]--;</div>
<div class="line"><a name="l00693"></a><span class="lineno">  693</span>&#160;                        insertDeg(w, u);</div>
<div class="line"><a name="l00694"></a><span class="lineno">  694</span>&#160;                        <a class="code" href="classColoringHeuristic.html#ae4cf7db5667d8d65aa6b7c41ee27ef60">bitR</a>-&gt;toCompl(u);</div>
<div class="line"><a name="l00695"></a><span class="lineno">  695</span>&#160;                        u = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00696"></a><span class="lineno">  696</span>&#160;                }</div>
<div class="line"><a name="l00697"></a><span class="lineno">  697</span>&#160;                <span class="keyword">delete</span> it;</div>
<div class="line"><a name="l00698"></a><span class="lineno">  698</span>&#160;        }</div>
<div class="line"><a name="l00699"></a><span class="lineno">  699</span>&#160;</div>
<div class="line"><a name="l00700"></a><span class="lineno">  700</span>&#160;        <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00701"></a><span class="lineno">  701</span>&#160;}</div>
<div class="line"><a name="l00702"></a><span class="lineno">  702</span>&#160;</div>
<div class="line"><a name="l00703"></a><span class="lineno">  703</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00704"></a><span class="lineno">  704</span>&#160;<span class="keywordtype">long</span> ColoringHeuristic::mcrCoverSort&lt;T&gt;(<a class="code" href="classGraph.html">Graph</a> * g, <span class="keywordtype">long</span>** cover, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * <a class="code" href="classColoringHeuristic.html#a40cd35433cef882c6d01ba41ba8bb324">factory</a>, <span class="keywordtype">long</span>* R, <span class="keywordtype">long</span> r) {</div>
<div class="line"><a name="l00705"></a><span class="lineno">  705</span>&#160;        <span class="keywordtype">long</span> <a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a> = g-&gt;nverts();</div>
<div class="line"><a name="l00706"></a><span class="lineno">  706</span>&#160;        <span class="keywordtype">long</span> degin[<a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a>];</div>
<div class="line"><a name="l00707"></a><span class="lineno">  707</span>&#160;        <span class="keywordtype">long</span> degree[<a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a>];</div>
<div class="line"><a name="l00708"></a><span class="lineno">  708</span>&#160;        <span class="keywordtype">long</span> i = r;</div>
<div class="line"><a name="l00709"></a><span class="lineno">  709</span>&#160;        <span class="keywordtype">long</span> v;</div>
<div class="line"><a name="l00710"></a><span class="lineno">  710</span>&#160;</div>
<div class="line"><a name="l00711"></a><span class="lineno">  711</span>&#160;        <span class="comment">//maximum minimum degree</span></div>
<div class="line"><a name="l00712"></a><span class="lineno">  712</span>&#160;        <span class="keywordtype">long</span> maxmindeg = 0;</div>
<div class="line"><a name="l00713"></a><span class="lineno">  713</span>&#160;</div>
<div class="line"><a name="l00714"></a><span class="lineno">  714</span>&#160;        <span class="comment">//to use the same function of comparation</span></div>
<div class="line"><a name="l00715"></a><span class="lineno">  715</span>&#160;        graphs_deg = degree;</div>
<div class="line"><a name="l00716"></a><span class="lineno">  716</span>&#160;        graphs_sat = degin;</div>
<div class="line"><a name="l00717"></a><span class="lineno">  717</span>&#160;</div>
<div class="line"><a name="l00718"></a><span class="lineno">  718</span>&#160;        memset(degin, 0, n*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l00719"></a><span class="lineno">  719</span>&#160;        memset(degree, 0, n*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l00720"></a><span class="lineno">  720</span>&#160;</div>
<div class="line"><a name="l00721"></a><span class="lineno">  721</span>&#160;        <span class="comment">//sets to represent R.</span></div>
<div class="line"><a name="l00722"></a><span class="lineno">  722</span>&#160;        T * <a class="code" href="classColoringHeuristic.html#ae4cf7db5667d8d65aa6b7c41ee27ef60">bitR</a> = <a class="code" href="classColoringHeuristic.html#a40cd35433cef882c6d01ba41ba8bb324">factory</a>-&gt;<a class="code" href="classFactory.html#a0ed0b3527539a0631d8147d8aa94b75a">newInstance</a>(n);</div>
<div class="line"><a name="l00723"></a><span class="lineno">  723</span>&#160;        T * <a class="code" href="classColoringHeuristic.html#a3af684edbb71a7a430e05e3e79ec938c">degR</a> = <a class="code" href="classColoringHeuristic.html#a40cd35433cef882c6d01ba41ba8bb324">factory</a>-&gt;<a class="code" href="classFactory.html#a0ed0b3527539a0631d8147d8aa94b75a">newInstance</a>(n);</div>
<div class="line"><a name="l00724"></a><span class="lineno">  724</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0 ; j &lt; r; j++)bitR-&gt;toSet(R[j]);</div>
<div class="line"><a name="l00725"></a><span class="lineno">  725</span>&#160;</div>
<div class="line"><a name="l00726"></a><span class="lineno">  726</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0; j &lt; r; j++) {</div>
<div class="line"><a name="l00727"></a><span class="lineno">  727</span>&#160;                degR-&gt;allToSet();</div>
<div class="line"><a name="l00728"></a><span class="lineno">  728</span>&#160;                <a class="code" href="classBitMapDirectlyAddressedSets.html">BitMapDirectlyAddressedSets&lt;Z&gt;::setIntersec</a>(degR, bitR);</div>
<div class="line"><a name="l00729"></a><span class="lineno">  729</span>&#160;                <a class="code" href="classBitMapDirectlyAddressedSets.html">BitMapDirectlyAddressedSets&lt;Z&gt;::setIntersec</a>(degR, g-&gt;neig(R[j]));</div>
<div class="line"><a name="l00730"></a><span class="lineno">  730</span>&#160;                degree[R[j]] = degR-&gt;cardOfSet();</div>
<div class="line"><a name="l00731"></a><span class="lineno">  731</span>&#160;        }</div>
<div class="line"><a name="l00732"></a><span class="lineno">  732</span>&#160;</div>
<div class="line"><a name="l00733"></a><span class="lineno">  733</span>&#160;        <span class="keywordtype">long</span>* RR = <span class="keyword">new</span> <span class="keywordtype">long</span>[r];</div>
<div class="line"><a name="l00734"></a><span class="lineno">  734</span>&#160;        memcpy(R,RR,r*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l00735"></a><span class="lineno">  735</span>&#160;        <a class="code" href="heap_8c.html#abf6db9c52c0af825f656899af4ffe24b">heapify</a>(RR, r, <span class="keyword">sizeof</span>(<span class="keywordtype">long</span>), <a class="code" href="ColoringHeuristic_8h.html#a4d397627f3e1fc3688431fac23b2de85">graphs_compar</a>);</div>
<div class="line"><a name="l00736"></a><span class="lineno">  736</span>&#160;        <a class="code" href="classDirectlyAddressedSet_1_1Iterator.html" title="A general iterator to scan a DirectlyAddressedSet.">DirectlyAddressedSet::Iterator</a>* it;</div>
<div class="line"><a name="l00737"></a><span class="lineno">  737</span>&#160;</div>
<div class="line"><a name="l00738"></a><span class="lineno">  738</span>&#160;        <span class="comment">//ordering</span></div>
<div class="line"><a name="l00739"></a><span class="lineno">  739</span>&#160;        <span class="keywordflow">while</span>(i &gt; 0){</div>
<div class="line"><a name="l00740"></a><span class="lineno">  740</span>&#160;                <span class="comment">//determine the head of the heap</span></div>
<div class="line"><a name="l00741"></a><span class="lineno">  741</span>&#160;                v = RR[0];</div>
<div class="line"><a name="l00742"></a><span class="lineno">  742</span>&#160;                maxmindeg = maxmindeg &lt; degin[v]? degin[v] : maxmindeg;</div>
<div class="line"><a name="l00743"></a><span class="lineno">  743</span>&#160;                <a class="code" href="heap_8c.html#a3c44c87035bb56d56d977b17bb2df558">heappoll</a>(RR, i--, <span class="keyword">sizeof</span>(<span class="keywordtype">long</span>),<a class="code" href="ColoringHeuristic_8h.html#a4d397627f3e1fc3688431fac23b2de85">graphs_compar</a>);</div>
<div class="line"><a name="l00744"></a><span class="lineno">  744</span>&#160;</div>
<div class="line"><a name="l00745"></a><span class="lineno">  745</span>&#160;                <span class="comment">//update info</span></div>
<div class="line"><a name="l00746"></a><span class="lineno">  746</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0; j &lt; r; j++)<span class="keywordflow">if</span>(R[j] == v) (*cover)[j] = i;</div>
<div class="line"><a name="l00747"></a><span class="lineno">  747</span>&#160;                it = g-&gt;neig(v)-&gt;newSetIterator(bitR);</div>
<div class="line"><a name="l00748"></a><span class="lineno">  748</span>&#160;                <span class="keywordtype">long</span> iti = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00749"></a><span class="lineno">  749</span>&#160;                <span class="keywordtype">long</span> iu = g-&gt;neig(v)-&gt;universeSize();</div>
<div class="line"><a name="l00750"></a><span class="lineno">  750</span>&#160;                <span class="keywordflow">while</span>(iti &lt; iu) {</div>
<div class="line"><a name="l00751"></a><span class="lineno">  751</span>&#160;                        degin[iti]++;</div>
<div class="line"><a name="l00752"></a><span class="lineno">  752</span>&#160;                        iti = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00753"></a><span class="lineno">  753</span>&#160;                }</div>
<div class="line"><a name="l00754"></a><span class="lineno">  754</span>&#160;                <a class="code" href="heap_8c.html#abf6db9c52c0af825f656899af4ffe24b">heapify</a>(RR, i, <span class="keyword">sizeof</span>(<span class="keywordtype">long</span>), <a class="code" href="ColoringHeuristic_8h.html#a4d397627f3e1fc3688431fac23b2de85">graphs_compar</a>);</div>
<div class="line"><a name="l00755"></a><span class="lineno">  755</span>&#160;        }</div>
<div class="line"><a name="l00756"></a><span class="lineno">  756</span>&#160;        <span class="keywordflow">return</span> maxmindeg;</div>
<div class="line"><a name="l00757"></a><span class="lineno">  757</span>&#160;}</div>
<div class="line"><a name="l00758"></a><span class="lineno">  758</span>&#160;</div>
<div class="line"><a name="l00759"></a><span class="lineno">  759</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00760"></a><span class="lineno">  760</span>&#160;<span class="keywordtype">long</span> ColoringHeuristic::mcrSort&lt;T&gt;(<a class="code" href="classGraph.html">Graph</a> * g, <span class="keywordtype">long</span>** cover, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * <a class="code" href="classColoringHeuristic.html#a40cd35433cef882c6d01ba41ba8bb324">factory</a>, <span class="keywordtype">long</span>* R, <span class="keywordtype">long</span> r, <span class="keywordtype">long</span>** Ro) {</div>
<div class="line"><a name="l00761"></a><span class="lineno">  761</span>&#160;        <span class="keywordtype">long</span> n = g-&gt;nverts();</div>
<div class="line"><a name="l00762"></a><span class="lineno">  762</span>&#160;        <span class="keywordtype">long</span> degin[<a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a>];</div>
<div class="line"><a name="l00763"></a><span class="lineno">  763</span>&#160;        <span class="keywordtype">long</span> degree[<a class="code" href="classColoringHeuristic.html#af0cb59214cd56b3cdb522d0cc4981273" title="max number of elements">n</a>];</div>
<div class="line"><a name="l00764"></a><span class="lineno">  764</span>&#160;        <span class="keywordtype">long</span> i = r;</div>
<div class="line"><a name="l00765"></a><span class="lineno">  765</span>&#160;        <span class="keywordtype">long</span> v;</div>
<div class="line"><a name="l00766"></a><span class="lineno">  766</span>&#160;        <span class="keywordtype">long</span> maxmindeg = 0;</div>
<div class="line"><a name="l00767"></a><span class="lineno">  767</span>&#160;        <span class="keywordtype">long</span> maxdeg = 0;</div>
<div class="line"><a name="l00768"></a><span class="lineno">  768</span>&#160;</div>
<div class="line"><a name="l00769"></a><span class="lineno">  769</span>&#160;        graphs_deg = degree;</div>
<div class="line"><a name="l00770"></a><span class="lineno">  770</span>&#160;        graphs_sat = degin;</div>
<div class="line"><a name="l00771"></a><span class="lineno">  771</span>&#160;</div>
<div class="line"><a name="l00772"></a><span class="lineno">  772</span>&#160;        memset(degin, 0, n*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l00773"></a><span class="lineno">  773</span>&#160;        memset(degree, 0, n*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l00774"></a><span class="lineno">  774</span>&#160;</div>
<div class="line"><a name="l00775"></a><span class="lineno">  775</span>&#160;        T * bitR = factory-&gt;newInstance(n);</div>
<div class="line"><a name="l00776"></a><span class="lineno">  776</span>&#160;        T * degR = factory-&gt;newInstance(n);</div>
<div class="line"><a name="l00777"></a><span class="lineno">  777</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0 ; j &lt; r; j++)bitR-&gt;toSet(R[j]);</div>
<div class="line"><a name="l00778"></a><span class="lineno">  778</span>&#160;</div>
<div class="line"><a name="l00779"></a><span class="lineno">  779</span>&#160;        <span class="comment">//calculate the degree in the subgraph</span></div>
<div class="line"><a name="l00780"></a><span class="lineno">  780</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0; j &lt; r; j++) {</div>
<div class="line"><a name="l00781"></a><span class="lineno">  781</span>&#160;                degR-&gt;allToSet();</div>
<div class="line"><a name="l00782"></a><span class="lineno">  782</span>&#160;                <a class="code" href="classBitMapDirectlyAddressedSets.html">BitMapDirectlyAddressedSets&lt;Z&gt;::setIntersec</a>(degR, bitR);</div>
<div class="line"><a name="l00783"></a><span class="lineno">  783</span>&#160;                <a class="code" href="classBitMapDirectlyAddressedSets.html">BitMapDirectlyAddressedSets&lt;Z&gt;::setIntersec</a>(degR, g-&gt;neig(R[j]));</div>
<div class="line"><a name="l00784"></a><span class="lineno">  784</span>&#160;                degree[R[j]] = degR-&gt;cardOfSet();</div>
<div class="line"><a name="l00785"></a><span class="lineno">  785</span>&#160;                maxdeg = maxdeg &lt; degree[R[j]]? degree[R[j]] : maxdeg;</div>
<div class="line"><a name="l00786"></a><span class="lineno">  786</span>&#160;        }</div>
<div class="line"><a name="l00787"></a><span class="lineno">  787</span>&#160;</div>
<div class="line"><a name="l00788"></a><span class="lineno">  788</span>&#160;        <span class="keywordtype">long</span>* RR = <span class="keyword">new</span> <span class="keywordtype">long</span>[r];</div>
<div class="line"><a name="l00789"></a><span class="lineno">  789</span>&#160;        memcpy(R,RR,r*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l00790"></a><span class="lineno">  790</span>&#160;        <a class="code" href="heap_8c.html#abf6db9c52c0af825f656899af4ffe24b">heapify</a>(RR, r, <span class="keyword">sizeof</span>(<span class="keywordtype">long</span>), <a class="code" href="ColoringHeuristic_8h.html#a4d397627f3e1fc3688431fac23b2de85">graphs_compar</a>);</div>
<div class="line"><a name="l00791"></a><span class="lineno">  791</span>&#160;        <a class="code" href="classDirectlyAddressedSet_1_1Iterator.html" title="A general iterator to scan a DirectlyAddressedSet.">DirectlyAddressedSet::Iterator</a>* it;</div>
<div class="line"><a name="l00792"></a><span class="lineno">  792</span>&#160;</div>
<div class="line"><a name="l00793"></a><span class="lineno">  793</span>&#160;        <span class="comment">//ordering</span></div>
<div class="line"><a name="l00794"></a><span class="lineno">  794</span>&#160;        <span class="keywordflow">while</span>(i &gt; 0){</div>
<div class="line"><a name="l00795"></a><span class="lineno">  795</span>&#160;                (*Ro)[i] = v = RR[0];</div>
<div class="line"><a name="l00796"></a><span class="lineno">  796</span>&#160;                maxmindeg = maxmindeg &lt; degin[v]? degin[v] : maxmindeg;</div>
<div class="line"><a name="l00797"></a><span class="lineno">  797</span>&#160;                <a class="code" href="heap_8c.html#a3c44c87035bb56d56d977b17bb2df558">heappoll</a>(RR, i--, <span class="keyword">sizeof</span>(<span class="keywordtype">long</span>),<a class="code" href="ColoringHeuristic_8h.html#a4d397627f3e1fc3688431fac23b2de85">graphs_compar</a>);</div>
<div class="line"><a name="l00798"></a><span class="lineno">  798</span>&#160;                (*cover)[i] = i &lt; maxdeg ? i : maxdeg;</div>
<div class="line"><a name="l00799"></a><span class="lineno">  799</span>&#160;                it = g-&gt;neig(v)-&gt;newIterator(bitR);</div>
<div class="line"><a name="l00800"></a><span class="lineno">  800</span>&#160;                <span class="keywordtype">long</span> iti = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00801"></a><span class="lineno">  801</span>&#160;                <span class="keywordtype">long</span> iu = g-&gt;neig(v)-&gt;universeSize();</div>
<div class="line"><a name="l00802"></a><span class="lineno">  802</span>&#160;                <span class="keywordflow">while</span>(iti &lt; iu) {</div>
<div class="line"><a name="l00803"></a><span class="lineno">  803</span>&#160;                        degin[iti]++;</div>
<div class="line"><a name="l00804"></a><span class="lineno">  804</span>&#160;                        iti = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00805"></a><span class="lineno">  805</span>&#160;                }</div>
<div class="line"><a name="l00806"></a><span class="lineno">  806</span>&#160;                <a class="code" href="heap_8c.html#abf6db9c52c0af825f656899af4ffe24b">heapify</a>(RR, i, <span class="keyword">sizeof</span>(<span class="keywordtype">long</span>), <a class="code" href="ColoringHeuristic_8h.html#a4d397627f3e1fc3688431fac23b2de85">graphs_compar</a>);</div>
<div class="line"><a name="l00807"></a><span class="lineno">  807</span>&#160;        }</div>
<div class="line"><a name="l00808"></a><span class="lineno">  808</span>&#160;        <span class="keywordflow">return</span> maxmindeg;</div>
<div class="line"><a name="l00809"></a><span class="lineno">  809</span>&#160;}</div>
<div class="line"><a name="l00810"></a><span class="lineno">  810</span>&#160;</div>
<div class="line"><a name="l00811"></a><span class="lineno">  811</span>&#160;<span class="comment">//&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;Old functions inherit from the old implementation&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;.</span></div>
<div class="line"><a name="l00812"></a><span class="lineno">  812</span>&#160;</div>
<div class="line"><a name="l00813"></a><span class="lineno"><a class="code" href="ColoringHeuristic_8h.html#a5323a965dacf2a0b2899756ea7757903">  813</a></span>&#160;<span class="preprocessor">#define graphs_declareListForAssignment(r,k)    long _i_; \</span></div>
<div class="line"><a name="l00814"></a><span class="lineno">  814</span>&#160;<span class="preprocessor">                                                        long _next_[r+1]; \</span></div>
<div class="line"><a name="l00815"></a><span class="lineno">  815</span>&#160;<span class="preprocessor">                                                        for (_i_ = 0; _i_ &lt;= r; _i_++) _next_[_i_] = r; \</span></div>
<div class="line"><a name="l00816"></a><span class="lineno">  816</span>&#160;<span class="preprocessor">                                                        long _covhead_[k+1]; \</span></div>
<div class="line"><a name="l00817"></a><span class="lineno">  817</span>&#160;<span class="preprocessor">                                                        for (_i_ = 0; _i_ &lt;= k; _i_++) _covhead_[_i_] = r</span></div>
<div class="line"><a name="l00818"></a><span class="lineno">  818</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00819"></a><span class="lineno"><a class="code" href="ColoringHeuristic_8h.html#ae1579b0f05e45332ca5dd69c2c3b3bb8">  819</a></span>&#160;<span class="preprocessor">#define callAssignClique(g, k, cover, i, coversize)     assignCliqueByMatrix(g, k, cover, i, &amp;coversize, _next_, _covhead_)</span></div>
<div class="line"><a name="l00820"></a><span class="lineno">  820</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00821"></a><span class="lineno">  821</span>&#160;</div>
<div class="line"><a name="l00822"></a><span class="lineno"><a class="code" href="ColoringHeuristic_8h.html#a77afdc36da863fbce2f11e9551ec4fba">  822</a></span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="ColoringHeuristic_8h.html#a77afdc36da863fbce2f11e9551ec4fba">graphs_assignCliqueByBitParallel</a>(<span class="keywordtype">long</span> **<a class="code" href="classColoringHeuristic.html#a99bba05a6a6c8df2bc7ffb4f1f5aea9b">colors</a>, <span class="keywordtype">long</span> **adj, <span class="keywordtype">long</span> k, <span class="keywordtype">long</span> wordsize, <span class="keywordtype">long</span> adj_bitl, <span class="keywordtype">long</span> i, <span class="keywordtype">long</span> mincolor, <span class="keywordtype">long</span> *coversize) {</div>
<div class="line"><a name="l00823"></a><span class="lineno">  823</span>&#160;      <span class="keywordtype">long</span> c=0,j=0,found=0;</div>
<div class="line"><a name="l00824"></a><span class="lineno">  824</span>&#160;      <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> aux=0;</div>
<div class="line"><a name="l00825"></a><span class="lineno">  825</span>&#160;</div>
<div class="line"><a name="l00826"></a><span class="lineno">  826</span>&#160;      <span class="keywordflow">for</span> (c = mincolor; c &lt; (*coversize); c++) {</div>
<div class="line"><a name="l00827"></a><span class="lineno">  827</span>&#160;              <span class="keywordflow">for</span>(j = 0; j &lt; adj_bitl; j++) {</div>
<div class="line"><a name="l00828"></a><span class="lineno">  828</span>&#160;                   aux= colors[c][j] &amp; adj[i][j];    <span class="comment">// We are not using mask to zero vertex out of scope</span></div>
<div class="line"><a name="l00829"></a><span class="lineno">  829</span>&#160;                   <span class="keywordflow">if</span>(aux!=0) {</div>
<div class="line"><a name="l00830"></a><span class="lineno">  830</span>&#160;                      found = 0;</div>
<div class="line"><a name="l00831"></a><span class="lineno">  831</span>&#160;                      <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00832"></a><span class="lineno">  832</span>&#160;                   }</div>
<div class="line"><a name="l00833"></a><span class="lineno">  833</span>&#160;                   <span class="keywordflow">else</span> found = 1;</div>
<div class="line"><a name="l00834"></a><span class="lineno">  834</span>&#160;              }</div>
<div class="line"><a name="l00835"></a><span class="lineno">  835</span>&#160;              <span class="keywordflow">if</span>(found) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00836"></a><span class="lineno">  836</span>&#160;      }</div>
<div class="line"><a name="l00837"></a><span class="lineno">  837</span>&#160;      <span class="keywordflow">if</span>(c &lt;= k) {</div>
<div class="line"><a name="l00838"></a><span class="lineno">  838</span>&#160;           colors[c][i/wordsize] |= (1 &lt;&lt; (wordsize - (i%wordsize) -1));</div>
<div class="line"><a name="l00839"></a><span class="lineno">  839</span>&#160;           <span class="keywordflow">if</span>( (c+1) &gt; (*coversize) ) (*coversize)++;</div>
<div class="line"><a name="l00840"></a><span class="lineno">  840</span>&#160;      }</div>
<div class="line"><a name="l00841"></a><span class="lineno">  841</span>&#160;</div>
<div class="line"><a name="l00842"></a><span class="lineno">  842</span>&#160;      <span class="keywordflow">return</span> c + 1;</div>
<div class="line"><a name="l00843"></a><span class="lineno">  843</span>&#160;}</div>
<div class="line"><a name="l00844"></a><span class="lineno">  844</span>&#160;</div>
<div class="line"><a name="l00845"></a><span class="lineno">  845</span>&#160;<span class="comment">// sort specified vertices of a specified graph in a non-increasing order of degrees, in the</span></div>
<div class="line"><a name="l00846"></a><span class="lineno">  846</span>&#160;<span class="comment">// following sense:</span></div>
<div class="line"><a name="l00847"></a><span class="lineno">  847</span>&#160;<span class="comment">// in a subgraph of the specified graph induced by a set of vertices V = {V_1,V_2, ... ,V_i}, for 1 ≤ i ≤ r,</span></div>
<div class="line"><a name="l00848"></a><span class="lineno">  848</span>&#160;<span class="comment">// it holds that V_i always has the maximum rank and the minimum degree in V.</span></div>
<div class="line"><a name="l00849"></a><span class="lineno">  849</span>&#160;<span class="comment">// exdeg is used to break ties</span></div>
<div class="line"><a name="l00850"></a><span class="lineno">  850</span>&#160;<span class="comment">// 2 vectors of r longegers are defined in the C function stack</span></div>
<div class="line"><a name="l00851"></a><span class="lineno">  851</span>&#160;<span class="comment">// vertices R[j] having rank[j]=min { rank[i] | i=0,1,...,r-1 } induce a regular subgraph</span></div>
<div class="line"><a name="l00852"></a><span class="lineno">  852</span>&#160;<span class="comment">// mcr order is obtained by sorting R in a non-increasing order of rank</span></div>
<div class="line"><a name="l00853"></a><span class="lineno">  853</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T, <span class="keyword">typename</span> Z&gt;</div>
<div class="line"><a name="l00854"></a><span class="lineno">  854</span>&#160;<span class="keywordtype">bool</span> <a class="code" href="classColoringHeuristic.html" title="This class encapsulates a set of algorithms to color a graph.">ColoringHeuristic&lt;T, Z&gt;::mcrSort</a>(<a class="code" href="classGraph.html">Graph&lt;T&gt;</a>* g, <span class="keywordtype">long</span>* d, <span class="keywordtype">long</span>** ng, <span class="keywordtype">long</span>* rank) {</div>
<div class="line"><a name="l00855"></a><span class="lineno">  855</span>&#160;        <span class="comment">// degrees used locally</span></div>
<div class="line"><a name="l00856"></a><span class="lineno">  856</span>&#160;        <span class="keywordtype">long</span> r = g-&gt;<a class="code" href="classDiGraph.html#aa7b94dd44ea199c74447ceeb2df08db7" title="The number of vertices.">nverts</a>();</div>
<div class="line"><a name="l00857"></a><span class="lineno">  857</span>&#160;        <span class="keywordtype">long</span> locald[r];</div>
<div class="line"><a name="l00858"></a><span class="lineno">  858</span>&#160;        memcpy(locald, d, r*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l00859"></a><span class="lineno">  859</span>&#160;        <span class="comment">// used to break ties</span></div>
<div class="line"><a name="l00860"></a><span class="lineno">  860</span>&#160;        <span class="keywordtype">long</span> exdeg[r];</div>
<div class="line"><a name="l00861"></a><span class="lineno">  861</span>&#160;        <span class="comment">// a negative number indicates that this parameter is not known</span></div>
<div class="line"><a name="l00862"></a><span class="lineno">  862</span>&#160;        memset(exdeg, -1, r*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l00863"></a><span class="lineno">  863</span>&#160;</div>
<div class="line"><a name="l00864"></a><span class="lineno">  864</span>&#160;        <span class="comment">// determine min deg</span></div>
<div class="line"><a name="l00865"></a><span class="lineno">  865</span>&#160;        <span class="keywordtype">long</span> Rmin[r];</div>
<div class="line"><a name="l00866"></a><span class="lineno">  866</span>&#160;        <span class="keywordtype">long</span> nrmin = 1;</div>
<div class="line"><a name="l00867"></a><span class="lineno">  867</span>&#160;        <span class="keywordtype">long</span> i = r - 1;</div>
<div class="line"><a name="l00868"></a><span class="lineno">  868</span>&#160;</div>
<div class="line"><a name="l00869"></a><span class="lineno">  869</span>&#160;        <span class="keywordtype">long</span> imin = 0;</div>
<div class="line"><a name="l00870"></a><span class="lineno">  870</span>&#160;        Rmin[0] = imin;</div>
<div class="line"><a name="l00871"></a><span class="lineno">  871</span>&#160;        <span class="keywordtype">long</span> degrmin = locald[imin];</div>
<div class="line"><a name="l00872"></a><span class="lineno">  872</span>&#160;        <span class="keywordtype">long</span> j;</div>
<div class="line"><a name="l00873"></a><span class="lineno">  873</span>&#160;        <span class="keywordflow">for</span> (j = imin + 1; j &lt; r; j++)</div>
<div class="line"><a name="l00874"></a><span class="lineno">  874</span>&#160;                <span class="keywordflow">if</span> (locald[j] &lt; degrmin) {</div>
<div class="line"><a name="l00875"></a><span class="lineno">  875</span>&#160;                        nrmin = 1;</div>
<div class="line"><a name="l00876"></a><span class="lineno">  876</span>&#160;                        Rmin[0] = j;</div>
<div class="line"><a name="l00877"></a><span class="lineno">  877</span>&#160;                        degrmin = locald[j];</div>
<div class="line"><a name="l00878"></a><span class="lineno">  878</span>&#160;                }</div>
<div class="line"><a name="l00879"></a><span class="lineno">  879</span>&#160;                <span class="keywordflow">else</span> <span class="keywordflow">if</span> (locald[j] == degrmin)</div>
<div class="line"><a name="l00880"></a><span class="lineno">  880</span>&#160;                        Rmin[nrmin++] = j;</div>
<div class="line"><a name="l00881"></a><span class="lineno">  881</span>&#160;</div>
<div class="line"><a name="l00882"></a><span class="lineno">  882</span>&#160;        <span class="keywordtype">long</span> rmin;</div>
<div class="line"><a name="l00883"></a><span class="lineno">  883</span>&#160;        memset(rank, 0, r*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l00884"></a><span class="lineno">  884</span>&#160;        <span class="keywordflow">while</span> (i &gt;= nrmin) {</div>
<div class="line"><a name="l00885"></a><span class="lineno">  885</span>&#160;                rmin = 0;</div>
<div class="line"><a name="l00886"></a><span class="lineno">  886</span>&#160;                <span class="keywordflow">if</span> (nrmin &gt; 1) {</div>
<div class="line"><a name="l00887"></a><span class="lineno">  887</span>&#160;                        <span class="keywordflow">for</span> (j = 1; j &lt; nrmin; j++) {</div>
<div class="line"><a name="l00888"></a><span class="lineno">  888</span>&#160;                                <span class="keywordflow">if</span> (exdeg[Rmin[rmin]] &lt; 0) {</div>
<div class="line"><a name="l00889"></a><span class="lineno">  889</span>&#160;                                        exdeg[Rmin[rmin]]=0;</div>
<div class="line"><a name="l00890"></a><span class="lineno">  890</span>&#160;                                        <span class="keywordtype">long</span> l;</div>
<div class="line"><a name="l00891"></a><span class="lineno">  891</span>&#160;                                        <span class="keywordflow">for</span> (l = 0; l &lt; locald[Rmin[rmin]]; l++)</div>
<div class="line"><a name="l00892"></a><span class="lineno">  892</span>&#160;                                                <span class="keywordflow">if</span> (!rank[ng[Rmin[rmin]][l]])</div>
<div class="line"><a name="l00893"></a><span class="lineno">  893</span>&#160;                                                        exdeg[Rmin[rmin]] += locald[ng[Rmin[rmin]][l]];</div>
<div class="line"><a name="l00894"></a><span class="lineno">  894</span>&#160;                                }</div>
<div class="line"><a name="l00895"></a><span class="lineno">  895</span>&#160;                                <span class="keywordflow">if</span> (exdeg[Rmin[j]] &lt; 0) {</div>
<div class="line"><a name="l00896"></a><span class="lineno">  896</span>&#160;                                        exdeg[Rmin[j]]=0;</div>
<div class="line"><a name="l00897"></a><span class="lineno">  897</span>&#160;                                        <span class="keywordtype">long</span> l;</div>
<div class="line"><a name="l00898"></a><span class="lineno">  898</span>&#160;                                        <span class="keywordflow">for</span> (l = 0; l &lt; locald[Rmin[j]]; l++)</div>
<div class="line"><a name="l00899"></a><span class="lineno">  899</span>&#160;                                                <span class="keywordflow">if</span> (!rank[ng[Rmin[j]][l]])</div>
<div class="line"><a name="l00900"></a><span class="lineno">  900</span>&#160;                                                        exdeg[Rmin[j]] += locald[ng[Rmin[j]][l]];</div>
<div class="line"><a name="l00901"></a><span class="lineno">  901</span>&#160;                                }</div>
<div class="line"><a name="l00902"></a><span class="lineno">  902</span>&#160;                                <span class="keywordflow">if</span> (exdeg[Rmin[j]] &lt; exdeg[Rmin[rmin]])</div>
<div class="line"><a name="l00903"></a><span class="lineno">  903</span>&#160;                                        rmin = j;</div>
<div class="line"><a name="l00904"></a><span class="lineno">  904</span>&#160;                        }</div>
<div class="line"><a name="l00905"></a><span class="lineno">  905</span>&#160;                }</div>
<div class="line"><a name="l00906"></a><span class="lineno">  906</span>&#160;</div>
<div class="line"><a name="l00907"></a><span class="lineno">  907</span>&#160;                rank[Rmin[rmin]] = --i;</div>
<div class="line"><a name="l00908"></a><span class="lineno">  908</span>&#160;</div>
<div class="line"><a name="l00909"></a><span class="lineno">  909</span>&#160;                <span class="keywordflow">while</span> (rank[imin])</div>
<div class="line"><a name="l00910"></a><span class="lineno">  910</span>&#160;                        imin++;</div>
<div class="line"><a name="l00911"></a><span class="lineno">  911</span>&#160;                <span class="keywordflow">for</span> (j = 0; j &lt; locald[Rmin[rmin]]; j++)</div>
<div class="line"><a name="l00912"></a><span class="lineno">  912</span>&#160;                        <span class="keywordflow">if</span> (!rank[ng[Rmin[rmin]][j]]) {</div>
<div class="line"><a name="l00913"></a><span class="lineno">  913</span>&#160;                                exdeg[ng[Rmin[rmin]][j]] -= locald[Rmin[rmin]];</div>
<div class="line"><a name="l00914"></a><span class="lineno">  914</span>&#160;                                locald[ng[Rmin[rmin]][j]]--;</div>
<div class="line"><a name="l00915"></a><span class="lineno">  915</span>&#160;                        }</div>
<div class="line"><a name="l00916"></a><span class="lineno">  916</span>&#160;</div>
<div class="line"><a name="l00917"></a><span class="lineno">  917</span>&#160;                Rmin[0] = imin;</div>
<div class="line"><a name="l00918"></a><span class="lineno">  918</span>&#160;                nrmin = 1;</div>
<div class="line"><a name="l00919"></a><span class="lineno">  919</span>&#160;                degrmin = locald[imin];</div>
<div class="line"><a name="l00920"></a><span class="lineno">  920</span>&#160;                <span class="keywordflow">for</span> (j = imin + 1; j &lt; r; j++)</div>
<div class="line"><a name="l00921"></a><span class="lineno">  921</span>&#160;                        <span class="keywordflow">if</span> (!rank[j])</div>
<div class="line"><a name="l00922"></a><span class="lineno">  922</span>&#160;                                <span class="keywordflow">if</span> (locald[j] &lt; degrmin) {</div>
<div class="line"><a name="l00923"></a><span class="lineno">  923</span>&#160;                                        nrmin = 1;</div>
<div class="line"><a name="l00924"></a><span class="lineno">  924</span>&#160;                                        Rmin[0] = j;</div>
<div class="line"><a name="l00925"></a><span class="lineno">  925</span>&#160;                                        degrmin = locald[j];</div>
<div class="line"><a name="l00926"></a><span class="lineno">  926</span>&#160;                                }</div>
<div class="line"><a name="l00927"></a><span class="lineno">  927</span>&#160;                                <span class="keywordflow">else</span> <span class="keywordflow">if</span> (locald[j] == degrmin)</div>
<div class="line"><a name="l00928"></a><span class="lineno">  928</span>&#160;                                        Rmin[nrmin++] = j;</div>
<div class="line"><a name="l00929"></a><span class="lineno">  929</span>&#160;        }</div>
<div class="line"><a name="l00930"></a><span class="lineno">  930</span>&#160;</div>
<div class="line"><a name="l00931"></a><span class="lineno">  931</span>&#160;        <span class="keywordtype">long</span> maxno = 0;</div>
<div class="line"><a name="l00932"></a><span class="lineno">  932</span>&#160;        --i;</div>
<div class="line"><a name="l00933"></a><span class="lineno">  933</span>&#160;        <span class="keywordflow">for</span> (j = imin; j &lt; r; j++)</div>
<div class="line"><a name="l00934"></a><span class="lineno">  934</span>&#160;                <span class="keywordflow">if</span> (!rank[j]) {</div>
<div class="line"><a name="l00935"></a><span class="lineno">  935</span>&#160;                        rank[j] = i;</div>
<div class="line"><a name="l00936"></a><span class="lineno">  936</span>&#160;                        maxno++;</div>
<div class="line"><a name="l00937"></a><span class="lineno">  937</span>&#160;                }</div>
<div class="line"><a name="l00938"></a><span class="lineno">  938</span>&#160;</div>
<div class="line"><a name="l00939"></a><span class="lineno">  939</span>&#160;        <span class="keywordflow">return</span> locald[imin] == maxno - 1;</div>
<div class="line"><a name="l00940"></a><span class="lineno">  940</span>&#160;}</div>
<div class="line"><a name="l00941"></a><span class="lineno">  941</span>&#160;</div>
<div class="line"><a name="l00942"></a><span class="lineno">  942</span>&#160;<span class="comment">// sort specified vertices of a specified graph in a non-increasing order of degrees, in the</span></div>
<div class="line"><a name="l00943"></a><span class="lineno">  943</span>&#160;<span class="comment">// following sense:</span></div>
<div class="line"><a name="l00944"></a><span class="lineno">  944</span>&#160;<span class="comment">// in a subgraph of the specified graph induced by a set of vertices V = {V_1,V_2, ... ,V_i}, for 1 ≤ i ≤ r,</span></div>
<div class="line"><a name="l00945"></a><span class="lineno">  945</span>&#160;<span class="comment">// it holds that V_i always has the maximum rank and the minimum degree in V.</span></div>
<div class="line"><a name="l00946"></a><span class="lineno">  946</span>&#160;<span class="comment">// exdeg is used to break ties; maximum rank is returned</span></div>
<div class="line"><a name="l00947"></a><span class="lineno">  947</span>&#160;<span class="comment">// 3 vectors of r longegers are defined in the C function stack</span></div>
<div class="line"><a name="l00948"></a><span class="lineno">  948</span>&#160;<span class="comment">// if true is returned, then vertices R[j] having rank[j]=max rank induce a clique</span></div>
<div class="line"><a name="l00949"></a><span class="lineno">  949</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T, <span class="keyword">typename</span> Z&gt;</div>
<div class="line"><a name="l00950"></a><span class="lineno">  950</span>&#160;<span class="keywordtype">bool</span> <a class="code" href="classColoringHeuristic.html" title="This class encapsulates a set of algorithms to color a graph.">ColoringHeuristic&lt;T, Z&gt;::mcrDegreeSort</a>(<a class="code" href="classGraph.html">Graph&lt;T&gt;</a>* g, <span class="keywordtype">long</span> * maxd, <span class="keywordtype">long</span> * rank) {</div>
<div class="line"><a name="l00951"></a><span class="lineno">  951</span>&#160;        <span class="comment">// degrees used locally</span></div>
<div class="line"><a name="l00952"></a><span class="lineno">  952</span>&#160;        <span class="keywordtype">long</span> i, j, r = g-&gt;<a class="code" href="classDiGraph.html#aa7b94dd44ea199c74447ceeb2df08db7" title="The number of vertices.">nverts</a>();</div>
<div class="line"><a name="l00953"></a><span class="lineno">  953</span>&#160;        <span class="keywordtype">long</span> deg[r];</div>
<div class="line"><a name="l00954"></a><span class="lineno">  954</span>&#160;        memset(deg, 0, r*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l00955"></a><span class="lineno">  955</span>&#160;        <span class="comment">// used to break ties</span></div>
<div class="line"><a name="l00956"></a><span class="lineno">  956</span>&#160;        <span class="keywordtype">long</span> exdeg[r];</div>
<div class="line"><a name="l00957"></a><span class="lineno">  957</span>&#160;        *maxd = 0;</div>
<div class="line"><a name="l00958"></a><span class="lineno">  958</span>&#160;        <span class="keywordflow">for</span> (i = 0; i &lt; r; i++) {</div>
<div class="line"><a name="l00959"></a><span class="lineno">  959</span>&#160;                <span class="keywordflow">for</span> (j = i + 1; j &lt; r; j++)</div>
<div class="line"><a name="l00960"></a><span class="lineno">  960</span>&#160;                        <span class="keywordflow">if</span> (g-&gt;<a class="code" href="classDiGraph.html#a37a974d4f6e7804c86feaf75a9837adb" title="Queries for an edge.">hasEdge</a>(i, j)) {</div>
<div class="line"><a name="l00961"></a><span class="lineno">  961</span>&#160;                                <span class="keywordflow">if</span> (++deg[i] &gt; *maxd)</div>
<div class="line"><a name="l00962"></a><span class="lineno">  962</span>&#160;                                        *maxd = deg[i];</div>
<div class="line"><a name="l00963"></a><span class="lineno">  963</span>&#160;                                <span class="keywordflow">if</span> (++deg[j] &gt; *maxd)</div>
<div class="line"><a name="l00964"></a><span class="lineno">  964</span>&#160;                                        *maxd = deg[j];</div>
<div class="line"><a name="l00965"></a><span class="lineno">  965</span>&#160;                        }</div>
<div class="line"><a name="l00966"></a><span class="lineno">  966</span>&#160;                exdeg[i] = -1;</div>
<div class="line"><a name="l00967"></a><span class="lineno">  967</span>&#160;        }</div>
<div class="line"><a name="l00968"></a><span class="lineno">  968</span>&#160;</div>
<div class="line"><a name="l00969"></a><span class="lineno">  969</span>&#160;        <span class="comment">// determine min deg</span></div>
<div class="line"><a name="l00970"></a><span class="lineno">  970</span>&#160;        <span class="keywordtype">long</span> Rmin[r];</div>
<div class="line"><a name="l00971"></a><span class="lineno">  971</span>&#160;        <span class="keywordtype">long</span> nrmin = 1;</div>
<div class="line"><a name="l00972"></a><span class="lineno">  972</span>&#160;        <span class="keywordtype">long</span> imin = 0;</div>
<div class="line"><a name="l00973"></a><span class="lineno">  973</span>&#160;        Rmin[0] = imin;</div>
<div class="line"><a name="l00974"></a><span class="lineno">  974</span>&#160;        <span class="keywordtype">long</span> degrmin = deg[imin];</div>
<div class="line"><a name="l00975"></a><span class="lineno">  975</span>&#160;        <span class="keywordflow">for</span> (j = imin + 1; j &lt; r; j++)</div>
<div class="line"><a name="l00976"></a><span class="lineno">  976</span>&#160;                <span class="keywordflow">if</span> (deg[j] &lt; degrmin) {</div>
<div class="line"><a name="l00977"></a><span class="lineno">  977</span>&#160;                        nrmin = 1;</div>
<div class="line"><a name="l00978"></a><span class="lineno">  978</span>&#160;                        Rmin[0] = j;</div>
<div class="line"><a name="l00979"></a><span class="lineno">  979</span>&#160;                        degrmin = deg[j];</div>
<div class="line"><a name="l00980"></a><span class="lineno">  980</span>&#160;                }</div>
<div class="line"><a name="l00981"></a><span class="lineno">  981</span>&#160;                <span class="keywordflow">else</span> <span class="keywordflow">if</span> (deg[j] == degrmin)</div>
<div class="line"><a name="l00982"></a><span class="lineno">  982</span>&#160;                        Rmin[nrmin++] = j;</div>
<div class="line"><a name="l00983"></a><span class="lineno">  983</span>&#160;</div>
<div class="line"><a name="l00984"></a><span class="lineno">  984</span>&#160;        <span class="keywordtype">long</span> rmin;</div>
<div class="line"><a name="l00985"></a><span class="lineno">  985</span>&#160;        memset(rank, 0, r*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l00986"></a><span class="lineno">  986</span>&#160;        i = r;</div>
<div class="line"><a name="l00987"></a><span class="lineno">  987</span>&#160;        <span class="keywordflow">while</span> (i &gt; nrmin) {</div>
<div class="line"><a name="l00988"></a><span class="lineno">  988</span>&#160;                rmin = 0;</div>
<div class="line"><a name="l00989"></a><span class="lineno">  989</span>&#160;                <span class="keywordflow">if</span> (nrmin &gt; 1) {</div>
<div class="line"><a name="l00990"></a><span class="lineno">  990</span>&#160;                        <span class="keywordflow">if</span> (exdeg[Rmin[rmin]] &lt; 0) {</div>
<div class="line"><a name="l00991"></a><span class="lineno">  991</span>&#160;                                exdeg[Rmin[rmin]]=0;</div>
<div class="line"><a name="l00992"></a><span class="lineno">  992</span>&#160;                                <span class="keywordtype">long</span> l;</div>
<div class="line"><a name="l00993"></a><span class="lineno">  993</span>&#160;                                <span class="keywordflow">for</span> (l = imin; l &lt; r; l++)</div>
<div class="line"><a name="l00994"></a><span class="lineno">  994</span>&#160;                                        <span class="keywordflow">if</span> (rank[l] == 0 &amp;&amp; l != Rmin[rmin] &amp;&amp; g-&gt;<a class="code" href="classDiGraph.html#a37a974d4f6e7804c86feaf75a9837adb" title="Queries for an edge.">hasEdge</a>(Rmin[rmin], l))</div>
<div class="line"><a name="l00995"></a><span class="lineno">  995</span>&#160;                                                exdeg[Rmin[rmin]] += deg[l];</div>
<div class="line"><a name="l00996"></a><span class="lineno">  996</span>&#160;                        }</div>
<div class="line"><a name="l00997"></a><span class="lineno">  997</span>&#160;                        <span class="keywordflow">for</span> (j = 1; j &lt; nrmin; j++) {</div>
<div class="line"><a name="l00998"></a><span class="lineno">  998</span>&#160;                                <span class="keywordflow">if</span> (exdeg[Rmin[j]] &lt; 0) {</div>
<div class="line"><a name="l00999"></a><span class="lineno">  999</span>&#160;                                        exdeg[Rmin[j]]=0;</div>
<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>&#160;                                        <span class="keywordtype">long</span> l;</div>
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>&#160;                                        <span class="keywordflow">for</span> (l = imin; l &lt; r; l++)</div>
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>&#160;                                                <span class="keywordflow">if</span> (rank[l] == 0 &amp;&amp; l != Rmin[j] &amp;&amp; g-&gt;<a class="code" href="classDiGraph.html#a37a974d4f6e7804c86feaf75a9837adb" title="Queries for an edge.">hasEdge</a>(Rmin[j], l))</div>
<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>&#160;                                                        exdeg[Rmin[j]] += deg[l];</div>
<div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>&#160;                                }</div>
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>&#160;                                <span class="keywordflow">if</span> (exdeg[Rmin[j]] &lt; exdeg[Rmin[rmin]])</div>
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>&#160;                                        rmin = j;</div>
<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>&#160;                        }</div>
<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>&#160;                }</div>
<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>&#160;</div>
<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>&#160;                rank[Rmin[rmin]] = i--;</div>
<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>&#160;</div>
<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>&#160;                <span class="keywordflow">while</span> (rank[imin] != 0)</div>
<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>&#160;                        imin++;</div>
<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>&#160;                <span class="keywordflow">for</span> (j = imin; j &lt; r; j++)</div>
<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>&#160;                        <span class="keywordflow">if</span> (rank[j] == 0 &amp;&amp; g-&gt;<a class="code" href="classDiGraph.html#a37a974d4f6e7804c86feaf75a9837adb" title="Queries for an edge.">hasEdge</a>(Rmin[rmin], j)) {</div>
<div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>&#160;                                exdeg[j] -= deg[Rmin[rmin]];</div>
<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>&#160;                                deg[j]--;</div>
<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>&#160;                        }</div>
<div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>&#160;</div>
<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>&#160;                Rmin[0] = imin;</div>
<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>&#160;                nrmin = 1;</div>
<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>&#160;                degrmin = deg[imin];</div>
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>&#160;                <span class="keywordflow">for</span> (j = imin + 1; j &lt; r; j++)</div>
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>&#160;                        <span class="keywordflow">if</span> (rank[j] == 0)</div>
<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>&#160;                                <span class="keywordflow">if</span> (deg[j] &lt; degrmin) {</div>
<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>&#160;                                        nrmin = 1;</div>
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>&#160;                                        Rmin[0] = j;</div>
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>&#160;                                        degrmin = deg[j];</div>
<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>&#160;                                }</div>
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>&#160;                                <span class="keywordflow">else</span> <span class="keywordflow">if</span> (deg[j] == degrmin)</div>
<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>&#160;                                        Rmin[nrmin++] = j;</div>
<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>&#160;        }</div>
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>&#160;</div>
<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>&#160;        <span class="keywordtype">long</span> maxno = 0;</div>
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>&#160;<span class="comment">//      --i;</span></div>
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>&#160;        <span class="keywordflow">for</span> (j = imin; j &lt; r; j++)</div>
<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>&#160;                <span class="keywordflow">if</span> (rank[j] == 0) {</div>
<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>&#160;                        rank[j] = i;</div>
<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>&#160;                        maxno++;</div>
<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>&#160;                }</div>
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>&#160;</div>
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>&#160;        <span class="keywordflow">return</span> deg[imin] == maxno - 1;</div>
<div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>&#160;}</div>
<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>&#160;</div>
<div class="line"><a name="l01045"></a><span class="lineno"><a class="code" href="ColoringHeuristic_8h.html#a32e148dcccc8b8059e1760623f81b84c"> 1045</a></span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="ColoringHeuristic_8h.html#a32e148dcccc8b8059e1760623f81b84c">graphs_assignByList</a>(<span class="keywordtype">long</span>* d, <span class="keywordtype">long</span>** ng, <span class="keywordtype">long</span> k, <span class="keywordtype">long</span>* cover, <span class="keywordtype">long</span> i, <span class="keywordtype">long</span>* coversize, <span class="keywordtype">long</span>* clique) {</div>
<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>&#160;        <span class="keywordtype">long</span> j;</div>
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>&#160;        <span class="comment">// current clique starts with size 1</span></div>
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>&#160;        cover[i] = 0;</div>
<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>&#160;</div>
<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>&#160;        <span class="comment">// find clique to include vertex as the smallest</span></div>
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>&#160;        <span class="comment">// not appearing in the neighborhood of i</span></div>
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>&#160;        memset(clique, 0, ((*coversize)+1)*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>&#160;        <span class="keywordflow">for</span> (j = 0; j &lt; d[i]; j++)</div>
<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>&#160;                clique[cover[ng[i][j]]] = 1;</div>
<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>&#160;</div>
<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>&#160;        <span class="keywordtype">long</span> c = 1;</div>
<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>&#160;        <span class="keywordflow">while</span> (c &lt;= *coversize &amp;&amp; clique[c])</div>
<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>&#160;                c++;</div>
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>&#160;        <span class="keywordflow">if</span> (c &lt;= k) {</div>
<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>&#160;                <span class="keywordflow">if</span> (c &gt; *coversize)</div>
<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>&#160;                        (*coversize)++;</div>
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>&#160;                cover[i] = c;</div>
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>&#160;        }</div>
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>&#160;</div>
<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>&#160;        <span class="keywordflow">return</span> c;</div>
<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>&#160;}</div>
<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>&#160;</div>
<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T, <span class="keyword">typename</span> Z&gt;</div>
<div class="line"><a name="l01069"></a><span class="lineno"><a class="code" href="ColoringHeuristic_8h.html#aec3e589d618970163e5d62397dbedbc0"> 1069</a></span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="ColoringHeuristic_8h.html#aec3e589d618970163e5d62397dbedbc0">graphs_assignCliqueByMatrix</a>(<a class="code" href="classGraph.html">Graph&lt;T&gt;</a>* g, <span class="keywordtype">long</span> k, <span class="keywordtype">long</span>* cover, <span class="keywordtype">long</span> i, <span class="keywordtype">long</span>* coversize, <span class="keywordtype">long</span>* next, <span class="keywordtype">long</span>* covhead) {</div>
<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>&#160;        <span class="keywordtype">long</span> c = 0, r = g-&gt;<a class="code" href="classDiGraph.html#aa7b94dd44ea199c74447ceeb2df08db7" title="The number of vertices.">nverts</a>();</div>
<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>&#160;        <span class="keywordtype">long</span> cc = covhead[c];</div>
<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>&#160;        <span class="keywordtype">long</span> antcc = r;</div>
<div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>&#160;        <span class="keywordflow">while</span> (!cover[i] &amp;&amp; c &lt; *coversize){</div>
<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>&#160;                <span class="comment">// search for cover to add</span></div>
<div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>&#160;                <span class="keywordflow">for</span> (; cc != covhead[c+1] &amp;&amp; g-&gt;<a class="code" href="classDiGraph.html#a37a974d4f6e7804c86feaf75a9837adb" title="Queries for an edge.">hasEdge</a>(i, cc); antcc = cc, cc = next[cc]);</div>
<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>&#160;                <span class="keywordflow">if</span> (cc == covhead[c+1])</div>
<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>&#160;                        cover[i] = c + 1;</div>
<div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>&#160;                <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>&#160;                        c++;</div>
<div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>&#160;                        <span class="keywordflow">for</span> (; cc != covhead[c]; antcc = cc, cc = next[cc]);</div>
<div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>&#160;                }</div>
<div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>&#160;        }</div>
<div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>&#160;        <span class="keywordflow">if</span> (c == *coversize &amp;&amp; *coversize &lt; k) {</div>
<div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>&#160;                (*coversize)++;</div>
<div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>&#160;                covhead[c] = i;</div>
<div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>&#160;                cover[i] = c + 1;</div>
<div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>&#160;        }</div>
<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>&#160;        <span class="comment">// include i in the tail of cover list</span></div>
<div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>&#160;        next[antcc] = i;</div>
<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>&#160;        next[i] = cc;</div>
<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>&#160;</div>
<div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>&#160;        <span class="keywordflow">return</span> c + 1;</div>
<div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>&#160;}</div>
<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>&#160;</div>
<div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/* GRAPHALGORITHM_H_ */</span><span class="preprocessor"></span></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Mon Nov 26 2012 17:06:45 for Data Structures for Sets and Graphs by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.1.1
</small></address>
</body>
</html>
